./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 701f399f Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-701f399 [2019-11-22 09:44:10,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 09:44:10,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 09:44:10,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 09:44:10,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 09:44:10,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 09:44:10,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 09:44:10,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 09:44:10,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 09:44:10,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 09:44:10,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 09:44:10,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 09:44:10,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 09:44:10,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 09:44:10,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 09:44:10,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 09:44:10,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 09:44:10,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 09:44:10,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 09:44:10,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 09:44:10,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 09:44:10,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 09:44:10,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 09:44:10,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 09:44:10,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 09:44:10,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 09:44:10,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 09:44:10,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 09:44:10,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 09:44:10,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 09:44:10,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 09:44:10,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 09:44:10,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 09:44:10,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 09:44:10,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 09:44:10,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 09:44:10,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 09:44:10,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 09:44:10,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 09:44:10,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 09:44:10,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 09:44:10,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-22 09:44:10,590 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 09:44:10,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 09:44:10,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 09:44:10,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 09:44:10,593 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 09:44:10,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 09:44:10,593 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 09:44:10,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 09:44:10,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 09:44:10,594 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 09:44:10,595 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 09:44:10,596 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 09:44:10,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 09:44:10,596 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 09:44:10,597 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 09:44:10,597 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 09:44:10,597 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 09:44:10,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 09:44:10,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 09:44:10,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 09:44:10,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 09:44:10,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 09:44:10,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 09:44:10,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 09:44:10,599 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 09:44:10,600 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 09:44:10,600 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 09:44:10,600 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c [2019-11-22 09:44:10,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 09:44:10,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 09:44:10,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 09:44:10,921 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 09:44:10,921 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 09:44:10,922 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-22 09:44:10,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124afb8e4/9aec9207dd9741ae87daa5c1a424967a/FLAG002054d82 [2019-11-22 09:44:11,546 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 09:44:11,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-22 09:44:11,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124afb8e4/9aec9207dd9741ae87daa5c1a424967a/FLAG002054d82 [2019-11-22 09:44:11,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124afb8e4/9aec9207dd9741ae87daa5c1a424967a [2019-11-22 09:44:11,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 09:44:11,839 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 09:44:11,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 09:44:11,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 09:44:11,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 09:44:11,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:44:11" (1/1) ... [2019-11-22 09:44:11,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c7b1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:11, skipping insertion in model container [2019-11-22 09:44:11,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:44:11" (1/1) ... [2019-11-22 09:44:11,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 09:44:11,909 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 09:44:12,315 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-22 09:44:12,316 INFO L968 CHandler]: at location: C: (int*) malloc(20 * sizeof(data->array)) [545] [2019-11-22 09:44:12,316 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-22 09:44:12,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:44:12,358 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-22 09:44:12,367 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 09:44:12,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:44:12,453 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 09:44:12,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:44:12,588 INFO L205 MainTranslator]: Completed translation [2019-11-22 09:44:12,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:12 WrapperNode [2019-11-22 09:44:12,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 09:44:12,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 09:44:12,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 09:44:12,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 09:44:12,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:12" (1/1) ... [2019-11-22 09:44:12,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:12" (1/1) ... [2019-11-22 09:44:12,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:12" (1/1) ... [2019-11-22 09:44:12,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:12" (1/1) ... [2019-11-22 09:44:12,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:12" (1/1) ... [2019-11-22 09:44:12,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:12" (1/1) ... [2019-11-22 09:44:12,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:12" (1/1) ... [2019-11-22 09:44:12,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 09:44:12,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 09:44:12,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 09:44:12,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 09:44:12,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 09:44:12,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 09:44:12,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 09:44:12,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:44:12,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 09:44:12,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 09:44:12,768 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-22 09:44:12,768 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-22 09:44:12,769 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-22 09:44:12,769 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 09:44:12,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 09:44:12,769 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 09:44:12,769 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 09:44:12,769 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 09:44:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 09:44:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 09:44:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 09:44:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 09:44:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 09:44:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 09:44:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 09:44:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 09:44:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 09:44:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 09:44:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 09:44:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 09:44:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 09:44:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 09:44:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 09:44:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 09:44:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 09:44:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 09:44:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 09:44:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 09:44:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 09:44:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 09:44:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 09:44:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 09:44:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 09:44:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 09:44:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 09:44:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 09:44:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 09:44:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 09:44:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 09:44:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 09:44:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 09:44:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 09:44:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 09:44:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 09:44:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 09:44:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 09:44:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 09:44:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 09:44:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 09:44:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 09:44:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 09:44:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 09:44:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 09:44:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 09:44:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 09:44:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 09:44:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 09:44:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 09:44:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 09:44:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 09:44:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 09:44:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 09:44:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 09:44:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 09:44:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 09:44:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 09:44:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 09:44:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 09:44:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 09:44:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 09:44:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 09:44:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 09:44:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 09:44:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 09:44:12,780 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 09:44:12,780 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 09:44:12,780 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 09:44:12,780 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 09:44:12,780 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 09:44:12,780 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 09:44:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 09:44:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 09:44:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 09:44:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 09:44:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 09:44:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 09:44:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 09:44:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 09:44:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 09:44:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 09:44:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 09:44:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 09:44:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 09:44:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 09:44:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 09:44:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 09:44:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 09:44:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 09:44:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 09:44:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 09:44:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 09:44:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 09:44:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 09:44:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 09:44:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 09:44:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 09:44:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 09:44:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 09:44:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 09:44:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 09:44:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 09:44:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-22 09:44:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 09:44:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-22 09:44:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 09:44:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 09:44:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-22 09:44:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-22 09:44:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 09:44:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-22 09:44:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 09:44:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 09:44:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 09:44:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 09:44:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 09:44:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 09:44:14,097 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 09:44:14,097 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-22 09:44:14,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:14 BoogieIcfgContainer [2019-11-22 09:44:14,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 09:44:14,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 09:44:14,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 09:44:14,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 09:44:14,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:44:11" (1/3) ... [2019-11-22 09:44:14,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46744d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:44:14, skipping insertion in model container [2019-11-22 09:44:14,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:12" (2/3) ... [2019-11-22 09:44:14,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46744d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:44:14, skipping insertion in model container [2019-11-22 09:44:14,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:14" (3/3) ... [2019-11-22 09:44:14,115 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2019-11-22 09:44:14,129 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 09:44:14,140 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 92 error locations. [2019-11-22 09:44:14,155 INFO L249 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2019-11-22 09:44:14,186 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 09:44:14,187 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 09:44:14,187 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 09:44:14,187 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 09:44:14,188 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 09:44:14,188 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 09:44:14,188 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 09:44:14,189 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 09:44:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-22 09:44:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-22 09:44:14,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:14,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:14,246 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 09:44:14,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:14,255 INFO L82 PathProgramCache]: Analyzing trace with hash 696010085, now seen corresponding path program 1 times [2019-11-22 09:44:14,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:14,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [135038939] [2019-11-22 09:44:14,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:14,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-22 09:44:14,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:14,514 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:14,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [135038939] [2019-11-22 09:44:14,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:14,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 09:44:14,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678616013] [2019-11-22 09:44:14,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-22 09:44:14,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:14,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-22 09:44:14,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-22 09:44:14,565 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 2 states. [2019-11-22 09:44:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:14,601 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2019-11-22 09:44:14,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-22 09:44:14,603 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-22 09:44:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:14,617 INFO L225 Difference]: With dead ends: 199 [2019-11-22 09:44:14,617 INFO L226 Difference]: Without dead ends: 196 [2019-11-22 09:44:14,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-22 09:44:14,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-22 09:44:14,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-11-22 09:44:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-22 09:44:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2019-11-22 09:44:14,684 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 8 [2019-11-22 09:44:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:14,685 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2019-11-22 09:44:14,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-22 09:44:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2019-11-22 09:44:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 09:44:14,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:14,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:14,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:14,892 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 09:44:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash 101562384, now seen corresponding path program 1 times [2019-11-22 09:44:14,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:14,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [55077198] [2019-11-22 09:44:14,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:15,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 09:44:15,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:15,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:44:15,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:15,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:15,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:15,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:44:15,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:15,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-22 09:44:15,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:15,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:15,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 09:44:15,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:17 [2019-11-22 09:44:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:15,273 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:15,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [55077198] [2019-11-22 09:44:15,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:15,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 09:44:15,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284950799] [2019-11-22 09:44:15,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:44:15,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:15,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:44:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:44:15,353 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 8 states. [2019-11-22 09:44:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:17,247 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2019-11-22 09:44:17,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 09:44:17,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 09:44:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:17,253 INFO L225 Difference]: With dead ends: 213 [2019-11-22 09:44:17,254 INFO L226 Difference]: Without dead ends: 213 [2019-11-22 09:44:17,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:44:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-22 09:44:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-11-22 09:44:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-22 09:44:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 205 transitions. [2019-11-22 09:44:17,272 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 205 transitions. Word has length 9 [2019-11-22 09:44:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:17,273 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 205 transitions. [2019-11-22 09:44:17,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:44:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2019-11-22 09:44:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 09:44:17,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:17,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:17,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:17,486 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 09:44:17,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:17,487 INFO L82 PathProgramCache]: Analyzing trace with hash 101562385, now seen corresponding path program 1 times [2019-11-22 09:44:17,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:17,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [957859234] [2019-11-22 09:44:17,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:17,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 09:44:17,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:17,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:44:17,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:17,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:17,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:17,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-22 09:44:17,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:17,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-22 09:44:17,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:17,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:17,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 09:44:17,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2019-11-22 09:44:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:17,826 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:17,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:18,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [957859234] [2019-11-22 09:44:18,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:18,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 09:44:18,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778564179] [2019-11-22 09:44:18,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:44:18,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:18,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:44:18,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:44:18,039 INFO L87 Difference]: Start difference. First operand 194 states and 205 transitions. Second operand 8 states. [2019-11-22 09:44:20,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:20,449 INFO L93 Difference]: Finished difference Result 210 states and 225 transitions. [2019-11-22 09:44:20,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 09:44:20,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 09:44:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:20,452 INFO L225 Difference]: With dead ends: 210 [2019-11-22 09:44:20,452 INFO L226 Difference]: Without dead ends: 210 [2019-11-22 09:44:20,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 09:44:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-22 09:44:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2019-11-22 09:44:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-22 09:44:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2019-11-22 09:44:20,467 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 9 [2019-11-22 09:44:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:20,467 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2019-11-22 09:44:20,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:44:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2019-11-22 09:44:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 09:44:20,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:20,468 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:20,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:20,671 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 09:44:20,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:20,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533154, now seen corresponding path program 1 times [2019-11-22 09:44:20,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:20,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1078176276] [2019-11-22 09:44:20,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:20,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 09:44:20,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:20,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:44:20,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:20,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:20,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:20,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 09:44:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:20,881 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:20,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1078176276] [2019-11-22 09:44:20,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:20,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-22 09:44:20,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978406465] [2019-11-22 09:44:20,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:44:20,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:20,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:44:20,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:44:20,900 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand 4 states. [2019-11-22 09:44:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:21,256 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2019-11-22 09:44:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:44:21,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 09:44:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:21,258 INFO L225 Difference]: With dead ends: 194 [2019-11-22 09:44:21,259 INFO L226 Difference]: Without dead ends: 194 [2019-11-22 09:44:21,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:44:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-22 09:44:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-22 09:44:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-22 09:44:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2019-11-22 09:44:21,270 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 10 [2019-11-22 09:44:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:21,270 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2019-11-22 09:44:21,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:44:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2019-11-22 09:44:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 09:44:21,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:21,271 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:21,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:21,475 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 09:44:21,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:21,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533153, now seen corresponding path program 1 times [2019-11-22 09:44:21,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:21,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1139904735] [2019-11-22 09:44:21,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:21,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 09:44:21,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:21,687 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 09:44:21,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:21,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:21,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:21,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 09:44:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:21,715 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:21,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1139904735] [2019-11-22 09:44:21,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:21,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 09:44:21,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433757491] [2019-11-22 09:44:21,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:44:21,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:21,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:44:21,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:44:21,777 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand 4 states. [2019-11-22 09:44:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:22,499 INFO L93 Difference]: Finished difference Result 192 states and 204 transitions. [2019-11-22 09:44:22,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 09:44:22,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 09:44:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:22,502 INFO L225 Difference]: With dead ends: 192 [2019-11-22 09:44:22,502 INFO L226 Difference]: Without dead ends: 192 [2019-11-22 09:44:22,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:44:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-22 09:44:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-11-22 09:44:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-22 09:44:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2019-11-22 09:44:22,511 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 10 [2019-11-22 09:44:22,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:22,511 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2019-11-22 09:44:22,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:44:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2019-11-22 09:44:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 09:44:22,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:22,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:22,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:22,720 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 09:44:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:22,721 INFO L82 PathProgramCache]: Analyzing trace with hash -182531198, now seen corresponding path program 1 times [2019-11-22 09:44:22,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:22,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [243906101] [2019-11-22 09:44:22,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:22,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 09:44:22,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:23,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:23,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-22 09:44:23,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:23,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:23,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:23,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-22 09:44:23,073 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:23,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:23,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 09:44:23,103 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:50, output treesize:24 [2019-11-22 09:44:23,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-22 09:44:23,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:23,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:23,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-22 09:44:23,181 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:23,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:23,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:23,198 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2019-11-22 09:44:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:23,213 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:23,707 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-22 09:44:23,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:23,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [243906101] [2019-11-22 09:44:23,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:23,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-22 09:44:23,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842829833] [2019-11-22 09:44:23,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 09:44:23,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:23,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 09:44:23,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-22 09:44:23,906 INFO L87 Difference]: Start difference. First operand 192 states and 204 transitions. Second operand 11 states. [2019-11-22 09:44:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:25,528 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2019-11-22 09:44:25,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 09:44:25,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-11-22 09:44:25,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:25,533 INFO L225 Difference]: With dead ends: 197 [2019-11-22 09:44:25,534 INFO L226 Difference]: Without dead ends: 197 [2019-11-22 09:44:25,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-22 09:44:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-22 09:44:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-11-22 09:44:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-22 09:44:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2019-11-22 09:44:25,542 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 15 [2019-11-22 09:44:25,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:25,542 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2019-11-22 09:44:25,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 09:44:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2019-11-22 09:44:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 09:44:25,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:25,544 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:25,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:25,747 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 09:44:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:25,748 INFO L82 PathProgramCache]: Analyzing trace with hash 675193263, now seen corresponding path program 1 times [2019-11-22 09:44:25,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:25,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [262554583] [2019-11-22 09:44:25,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:25,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 09:44:25,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:25,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:25,998 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:25,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:26,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [262554583] [2019-11-22 09:44:26,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:26,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 09:44:26,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864526070] [2019-11-22 09:44:26,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:44:26,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:26,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:44:26,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:44:26,016 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand 4 states. [2019-11-22 09:44:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:26,064 INFO L93 Difference]: Finished difference Result 273 states and 289 transitions. [2019-11-22 09:44:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:44:26,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-22 09:44:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:26,066 INFO L225 Difference]: With dead ends: 273 [2019-11-22 09:44:26,066 INFO L226 Difference]: Without dead ends: 273 [2019-11-22 09:44:26,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 09:44:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-22 09:44:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 237. [2019-11-22 09:44:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-22 09:44:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 289 transitions. [2019-11-22 09:44:26,074 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 289 transitions. Word has length 17 [2019-11-22 09:44:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:26,075 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 289 transitions. [2019-11-22 09:44:26,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:44:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 289 transitions. [2019-11-22 09:44:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 09:44:26,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:26,076 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:26,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:26,279 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 09:44:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash -543839094, now seen corresponding path program 1 times [2019-11-22 09:44:26,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:26,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2135692108] [2019-11-22 09:44:26,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:26,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 09:44:26,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:26,523 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_111|], 1=[|v_#valid_151|]} [2019-11-22 09:44:26,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:26,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-22 09:44:26,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:26,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:26,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:26,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-22 09:44:26,549 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:26,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:26,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:44:26,560 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-22 09:44:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:26,574 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:26,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2135692108] [2019-11-22 09:44:26,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:26,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 09:44:26,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987996453] [2019-11-22 09:44:26,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:44:26,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:26,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:44:26,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:44:26,627 INFO L87 Difference]: Start difference. First operand 237 states and 289 transitions. Second operand 4 states. [2019-11-22 09:44:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:27,732 INFO L93 Difference]: Finished difference Result 272 states and 333 transitions. [2019-11-22 09:44:27,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 09:44:27,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 09:44:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:27,736 INFO L225 Difference]: With dead ends: 272 [2019-11-22 09:44:27,736 INFO L226 Difference]: Without dead ends: 272 [2019-11-22 09:44:27,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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 09:44:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-22 09:44:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 228. [2019-11-22 09:44:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-22 09:44:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 271 transitions. [2019-11-22 09:44:27,744 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 271 transitions. Word has length 18 [2019-11-22 09:44:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:27,744 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 271 transitions. [2019-11-22 09:44:27,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:44:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 271 transitions. [2019-11-22 09:44:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 09:44:27,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:27,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:27,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:27,956 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 09:44:27,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:27,956 INFO L82 PathProgramCache]: Analyzing trace with hash -543839095, now seen corresponding path program 1 times [2019-11-22 09:44:27,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:27,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [95346280] [2019-11-22 09:44:27,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:28,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 09:44:28,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:28,217 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-22 09:44:28,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-11-22 09:44:28,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:28,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:28,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:44:28,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-22 09:44:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:28,239 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:28,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [95346280] [2019-11-22 09:44:28,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:28,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 09:44:28,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094743122] [2019-11-22 09:44:28,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 09:44:28,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 09:44:28,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 09:44:28,252 INFO L87 Difference]: Start difference. First operand 228 states and 271 transitions. Second operand 4 states. [2019-11-22 09:44:28,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:28,892 INFO L93 Difference]: Finished difference Result 256 states and 301 transitions. [2019-11-22 09:44:28,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 09:44:28,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 09:44:28,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:28,895 INFO L225 Difference]: With dead ends: 256 [2019-11-22 09:44:28,895 INFO L226 Difference]: Without dead ends: 256 [2019-11-22 09:44:28,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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 09:44:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-22 09:44:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 222. [2019-11-22 09:44:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-22 09:44:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 261 transitions. [2019-11-22 09:44:28,903 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 261 transitions. Word has length 18 [2019-11-22 09:44:28,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:28,903 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 261 transitions. [2019-11-22 09:44:28,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 09:44:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 261 transitions. [2019-11-22 09:44:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 09:44:28,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:28,904 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:29,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:29,111 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 09:44:29,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:29,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108428, now seen corresponding path program 1 times [2019-11-22 09:44:29,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:29,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1409374774] [2019-11-22 09:44:29,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:29,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 09:44:29,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:29,353 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-22 09:44:29,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-22 09:44:29,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:29,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:29,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:44:29,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-22 09:44:29,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:44:29,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:29,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:29,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:29,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-22 09:44:29,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-22 09:44:29,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:29,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:29,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:29,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-22 09:44:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:29,437 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:29,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1409374774] [2019-11-22 09:44:29,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:29,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 09:44:29,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134526644] [2019-11-22 09:44:29,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 09:44:29,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:29,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 09:44:29,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 09:44:29,449 INFO L87 Difference]: Start difference. First operand 222 states and 261 transitions. Second operand 5 states. [2019-11-22 09:44:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:30,148 INFO L93 Difference]: Finished difference Result 231 states and 267 transitions. [2019-11-22 09:44:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 09:44:30,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-22 09:44:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:30,152 INFO L225 Difference]: With dead ends: 231 [2019-11-22 09:44:30,152 INFO L226 Difference]: Without dead ends: 231 [2019-11-22 09:44:30,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-22 09:44:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-22 09:44:30,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2019-11-22 09:44:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-22 09:44:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 259 transitions. [2019-11-22 09:44:30,160 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 259 transitions. Word has length 22 [2019-11-22 09:44:30,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:30,161 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 259 transitions. [2019-11-22 09:44:30,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 09:44:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 259 transitions. [2019-11-22 09:44:30,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 09:44:30,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:30,162 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:30,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:30,366 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 09:44:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:30,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108427, now seen corresponding path program 1 times [2019-11-22 09:44:30,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:30,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1421033475] [2019-11-22 09:44:30,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:30,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 09:44:30,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:30,639 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:30,639 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-22 09:44:30,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:30,664 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-22 09:44:30,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:30,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-22 09:44:30,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:44:30,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:30,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:30,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:44:30,705 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:30,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:30,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:30,717 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2019-11-22 09:44:30,765 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-22 09:44:30,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:30,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:30,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-22 09:44:30,784 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:30,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:30,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:30,791 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-22 09:44:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:30,808 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:44:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:44:31,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1421033475] [2019-11-22 09:44:31,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:44:31,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 09:44:31,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609771851] [2019-11-22 09:44:31,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:44:31,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 09:44:31,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:44:31,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:44:31,120 INFO L87 Difference]: Start difference. First operand 221 states and 259 transitions. Second operand 10 states. [2019-11-22 09:44:34,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:44:34,448 INFO L93 Difference]: Finished difference Result 323 states and 379 transitions. [2019-11-22 09:44:34,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 09:44:34,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-22 09:44:34,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:44:34,451 INFO L225 Difference]: With dead ends: 323 [2019-11-22 09:44:34,452 INFO L226 Difference]: Without dead ends: 323 [2019-11-22 09:44:34,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-11-22 09:44:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-22 09:44:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 237. [2019-11-22 09:44:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-22 09:44:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 277 transitions. [2019-11-22 09:44:34,461 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 277 transitions. Word has length 22 [2019-11-22 09:44:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:44:34,462 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 277 transitions. [2019-11-22 09:44:34,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:44:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 277 transitions. [2019-11-22 09:44:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 09:44:34,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:44:34,463 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:44:34,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:34,667 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-22 09:44:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:44:34,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1143894645, now seen corresponding path program 1 times [2019-11-22 09:44:34,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 09:44:34,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1758904715] [2019-11-22 09:44:34,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:44:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:44:35,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-22 09:44:35,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:44:35,245 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_117|], 1=[|v_#valid_170|]} [2019-11-22 09:44:35,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:35,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-22 09:44:35,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:35,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:35,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:35,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-22 09:44:35,268 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:35,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:35,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:35,279 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-22 09:44:35,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:44:35,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:35,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:35,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 09:44:35,323 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:35,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:35,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 09:44:35,338 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:28 [2019-11-22 09:44:35,420 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_69|], 4=[|v_#memory_$Pointer$.base_70|]} [2019-11-22 09:44:35,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:44:35,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2019-11-22 09:44:35,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:35,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:44:35,670 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-11-22 09:44:35,671 INFO L343 Elim1Store]: treesize reduction 38, result has 66.4 percent of original size [2019-11-22 09:44:35,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 144 [2019-11-22 09:44:35,673 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:44:35,764 INFO L567 ElimStorePlain]: treesize reduction 89, result has 51.1 percent of original size [2019-11-22 09:44:35,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:44:35,765 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:156, output treesize:93 [2019-11-22 09:44:41,833 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-22 09:44:43,913 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-22 09:44:45,981 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 44 [2019-11-22 09:44:46,443 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-22 09:44:46,443 INFO L343 Elim1Store]: treesize reduction 18, result has 92.2 percent of original size [2019-11-22 09:44:46,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 289 [2019-11-22 09:44:46,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:44:46,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:46,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:44:47,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 27 xjuncts. [2019-11-22 09:45:35,873 WARN L192 SmtUtils]: Spent 48.87 s on a formula simplification. DAG size of input: 463 DAG size of output: 63 [2019-11-22 09:45:35,874 INFO L567 ElimStorePlain]: treesize reduction 66548, result has 0.6 percent of original size [2019-11-22 09:45:36,330 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-22 09:45:36,331 INFO L343 Elim1Store]: treesize reduction 18, result has 94.0 percent of original size [2019-11-22 09:45:36,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 380 treesize of output 482 [2019-11-22 09:45:36,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:45:36,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 09:45:36,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 12 xjuncts. [2019-11-22 09:46:40,144 WARN L192 SmtUtils]: Spent 1.06 m on a formula simplification. DAG size of input: 343 DAG size of output: 61 [2019-11-22 09:46:40,145 INFO L567 ElimStorePlain]: treesize reduction 74919, result has 0.6 percent of original size [2019-11-22 09:46:40,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-22 09:46:40,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:182, output treesize:377 [2019-11-22 09:46:58,442 WARN L192 SmtUtils]: Spent 12.14 s on a formula simplification. DAG size of input: 89 DAG size of output: 35 [2019-11-22 09:47:00,564 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-22 09:47:00,573 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 6=[|#memory_$Pointer$.offset|]} [2019-11-22 09:47:00,580 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 50 treesize of output 26 [2019-11-22 09:47:00,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 09:47:00,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:47:00,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 09:47:00,628 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-22 09:47:00,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2019-11-22 09:47:00,629 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:47:00,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:47:00,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:47:00,639 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:78, output treesize:21 [2019-11-22 09:47:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:47:00,683 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 09:47:01,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:47:01,080 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:47:01,107 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 09:47:01,232 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-22 09:47:01,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:47:01,241 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 09:47:01,257 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 09:47:01,369 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-22 09:47:01,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 09:47:01,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-22 09:47:01,372 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:141 [2019-11-22 09:47:15,804 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-22 09:47:27,549 WARN L192 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-22 09:47:27,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:47:27,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 09:47:27,778 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-22 09:47:27,783 INFO L168 Benchmark]: Toolchain (without parser) took 195944.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -137.6 MB). Peak memory consumption was 176.4 MB. Max. memory is 11.5 GB. [2019-11-22 09:47:27,783 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:47:27,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-22 09:47:27,784 INFO L168 Benchmark]: Boogie Preprocessor took 119.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:47:27,784 INFO L168 Benchmark]: RCFGBuilder took 1389.21 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: 90.4 MB). Peak memory consumption was 90.4 MB. Max. memory is 11.5 GB. [2019-11-22 09:47:27,784 INFO L168 Benchmark]: TraceAbstraction took 193681.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -79.8 MB). Peak memory consumption was 89.6 MB. Max. memory is 11.5 GB. [2019-11-22 09:47:27,786 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.27 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 748.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1389.21 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: 90.4 MB). Peak memory consumption was 90.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 193681.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -79.8 MB). Peak memory consumption was 89.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...