./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 65a59966 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/optional_data_creation_test04-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-65a5996 [2019-11-20 19:18:40,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 19:18:40,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 19:18:40,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 19:18:40,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 19:18:40,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 19:18:40,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 19:18:40,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 19:18:40,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 19:18:40,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 19:18:40,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 19:18:40,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 19:18:40,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 19:18:40,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 19:18:40,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 19:18:40,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 19:18:40,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 19:18:40,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 19:18:40,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 19:18:40,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 19:18:40,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 19:18:40,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 19:18:40,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 19:18:40,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 19:18:40,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 19:18:40,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 19:18:40,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 19:18:40,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 19:18:40,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 19:18:40,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 19:18:40,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 19:18:40,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 19:18:40,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 19:18:40,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 19:18:40,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 19:18:40,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 19:18:40,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 19:18:40,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 19:18:40,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 19:18:40,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 19:18:40,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 19:18:40,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 19:18:40,853 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 19:18:40,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 19:18:40,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 19:18:40,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 19:18:40,855 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 19:18:40,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 19:18:40,855 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 19:18:40,855 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 19:18:40,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 19:18:40,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 19:18:40,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 19:18:40,856 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 19:18:40,856 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 19:18:40,857 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 19:18:40,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 19:18:40,857 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 19:18:40,857 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 19:18:40,857 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 19:18:40,858 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 19:18:40,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 19:18:40,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 19:18:40,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 19:18:40,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 19:18:40,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 19:18:40,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 19:18:40,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 19:18:40,860 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 19:18:40,860 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 19:18:40,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 19:18:40,860 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-11-20 19:18:41,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 19:18:41,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 19:18:41,202 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 19:18:41,203 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 19:18:41,205 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 19:18:41,206 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-20 19:18:41,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7071ffbfe/d09b6831e3184975a769e04881c2f893/FLAG76f67fcb0 [2019-11-20 19:18:41,828 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 19:18:41,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-20 19:18:41,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7071ffbfe/d09b6831e3184975a769e04881c2f893/FLAG76f67fcb0 [2019-11-20 19:18:42,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7071ffbfe/d09b6831e3184975a769e04881c2f893 [2019-11-20 19:18:42,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 19:18:42,129 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 19:18:42,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 19:18:42,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 19:18:42,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 19:18:42,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:18:42" (1/1) ... [2019-11-20 19:18:42,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13847bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:18:42, skipping insertion in model container [2019-11-20 19:18:42,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:18:42" (1/1) ... [2019-11-20 19:18:42,146 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 19:18:42,182 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 19:18:42,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 19:18:42,596 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 19:18:42,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 19:18:42,712 INFO L192 MainTranslator]: Completed translation [2019-11-20 19:18:42,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:18:42 WrapperNode [2019-11-20 19:18:42,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 19:18:42,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 19:18:42,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 19:18:42,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 19:18:42,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:18:42" (1/1) ... [2019-11-20 19:18:42,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:18:42" (1/1) ... [2019-11-20 19:18:42,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:18:42" (1/1) ... [2019-11-20 19:18:42,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:18:42" (1/1) ... [2019-11-20 19:18:42,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:18:42" (1/1) ... [2019-11-20 19:18:42,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:18:42" (1/1) ... [2019-11-20 19:18:42,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:18:42" (1/1) ... [2019-11-20 19:18:42,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 19:18:42,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 19:18:42,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 19:18:42,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 19:18:42,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:18:42" (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-20 19:18:42,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 19:18:42,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 19:18:42,846 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 19:18:42,846 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 19:18:42,846 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-20 19:18:42,847 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-20 19:18:42,847 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-20 19:18:42,848 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 19:18:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 19:18:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 19:18:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 19:18:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 19:18:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 19:18:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 19:18:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 19:18:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 19:18:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 19:18:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 19:18:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 19:18:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 19:18:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 19:18:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 19:18:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 19:18:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 19:18:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 19:18:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 19:18:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 19:18:42,854 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 19:18:42,854 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 19:18:42,854 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 19:18:42,854 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 19:18:42,854 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 19:18:42,854 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 19:18:42,854 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 19:18:42,855 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 19:18:42,855 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 19:18:42,855 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 19:18:42,855 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 19:18:42,855 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 19:18:42,855 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 19:18:42,855 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 19:18:42,856 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 19:18:42,856 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 19:18:42,856 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 19:18:42,856 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 19:18:42,857 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 19:18:42,857 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 19:18:42,857 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 19:18:42,857 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 19:18:42,857 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 19:18:42,858 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 19:18:42,858 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 19:18:42,858 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 19:18:42,858 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 19:18:42,858 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 19:18:42,859 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 19:18:42,859 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 19:18:42,859 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 19:18:42,859 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 19:18:42,859 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 19:18:42,860 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 19:18:42,860 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 19:18:42,860 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 19:18:42,860 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 19:18:42,860 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 19:18:42,860 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 19:18:42,861 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 19:18:42,861 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 19:18:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 19:18:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 19:18:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 19:18:42,863 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 19:18:42,863 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 19:18:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 19:18:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 19:18:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 19:18:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 19:18:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 19:18:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 19:18:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 19:18:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 19:18:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 19:18:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 19:18:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 19:18:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 19:18:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 19:18:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 19:18:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 19:18:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 19:18:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 19:18:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 19:18:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 19:18:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 19:18:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 19:18:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 19:18:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 19:18:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 19:18:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 19:18:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 19:18:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 19:18:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 19:18:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 19:18:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 19:18:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 19:18:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 19:18:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 19:18:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 19:18:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 19:18:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 19:18:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 19:18:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 19:18:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 19:18:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 19:18:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 19:18:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 19:18:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-20 19:18:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 19:18:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 19:18:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 19:18:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 19:18:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-20 19:18:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 19:18:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-20 19:18:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 19:18:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 19:18:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 19:18:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 19:18:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 19:18:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 19:18:43,778 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 19:18:43,778 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-20 19:18:43,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:18:43 BoogieIcfgContainer [2019-11-20 19:18:43,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 19:18:43,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 19:18:43,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 19:18:43,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 19:18:43,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:18:42" (1/3) ... [2019-11-20 19:18:43,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d087dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:18:43, skipping insertion in model container [2019-11-20 19:18:43,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:18:42" (2/3) ... [2019-11-20 19:18:43,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d087dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:18:43, skipping insertion in model container [2019-11-20 19:18:43,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:18:43" (3/3) ... [2019-11-20 19:18:43,789 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-20 19:18:43,799 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 19:18:43,808 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-20 19:18:43,821 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-20 19:18:43,842 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 19:18:43,842 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 19:18:43,842 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 19:18:43,842 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 19:18:43,843 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 19:18:43,843 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 19:18:43,843 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 19:18:43,843 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 19:18:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-20 19:18:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 19:18:43,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:43,873 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:18:43,874 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:18:43,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:18:43,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1597989777, now seen corresponding path program 1 times [2019-11-20 19:18:43,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:18:43,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [497610402] [2019-11-20 19:18:43,893 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-20 19:18:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:18:44,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 19:18:44,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:18:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:44,142 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:18:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:44,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [497610402] [2019-11-20 19:18:44,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:18:44,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 19:18:44,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288337049] [2019-11-20 19:18:44,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 19:18:44,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:18:44,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 19:18:44,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 19:18:44,186 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-20 19:18:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:18:44,210 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-20 19:18:44,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 19:18:44,211 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-20 19:18:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:18:44,223 INFO L225 Difference]: With dead ends: 110 [2019-11-20 19:18:44,223 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 19:18:44,225 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-20 19:18:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 19:18:44,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 19:18:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 19:18:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-20 19:18:44,275 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-20 19:18:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:18:44,276 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-20 19:18:44,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 19:18:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-20 19:18:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 19:18:44,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:44,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:18:44,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:18:44,480 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:18:44,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:18:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857581, now seen corresponding path program 1 times [2019-11-20 19:18:44,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:18:44,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [540220276] [2019-11-20 19:18:44,482 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-20 19:18:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:18:44,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 19:18:44,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:18:44,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:18:44,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:44,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:44,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:18:44,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 19:18:44,788 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:44,788 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-20 19:18:44,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:44,814 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 19:18:44,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 19:18:44,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 19:18:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:44,834 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:18:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:44,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [540220276] [2019-11-20 19:18:44,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:18:44,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 19:18:44,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805776142] [2019-11-20 19:18:44,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 19:18:44,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:18:44,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 19:18:44,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 19:18:44,858 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2019-11-20 19:18:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:18:45,485 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-20 19:18:45,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 19:18:45,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-20 19:18:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:18:45,491 INFO L225 Difference]: With dead ends: 116 [2019-11-20 19:18:45,492 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 19:18:45,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 19:18:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 19:18:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-20 19:18:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 19:18:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-20 19:18:45,511 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-20 19:18:45,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:18:45,511 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-20 19:18:45,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 19:18:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-20 19:18:45,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 19:18:45,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:45,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:18:45,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:18:45,719 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:18:45,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:18:45,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857580, now seen corresponding path program 1 times [2019-11-20 19:18:45,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:18:45,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1660416769] [2019-11-20 19:18:45,724 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-20 19:18:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:18:45,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 19:18:45,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:18:45,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:18:45,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:46,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:46,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:18:46,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:46,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:46,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:18:46,028 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 19:18:46,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 19:18:46,094 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 12 treesize of output 14 [2019-11-20 19:18:46,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:46,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:46,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 19:18:46,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 19:18:46,133 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:46,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:46,147 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-20 19:18:46,147 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-20 19:18:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:46,174 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:18:46,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:18:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:46,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1660416769] [2019-11-20 19:18:46,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:18:46,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 19:18:46,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333377900] [2019-11-20 19:18:46,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 19:18:46,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:18:46,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 19:18:46,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 19:18:46,502 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-20 19:18:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:18:50,673 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-20 19:18:50,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 19:18:50,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-20 19:18:50,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:18:50,677 INFO L225 Difference]: With dead ends: 115 [2019-11-20 19:18:50,677 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 19:18:50,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 19:18:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 19:18:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-20 19:18:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 19:18:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-20 19:18:50,688 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-20 19:18:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:18:50,689 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-20 19:18:50,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 19:18:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-20 19:18:50,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 19:18:50,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:50,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:18:50,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:18:50,892 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:18:50,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:18:50,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042754, now seen corresponding path program 1 times [2019-11-20 19:18:50,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:18:50,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [534603289] [2019-11-20 19:18:50,894 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-20 19:18:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:18:51,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 19:18:51,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:18:51,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:18:51,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:51,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:51,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:18:51,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 19:18:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:51,112 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:18:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:51,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [534603289] [2019-11-20 19:18:51,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:18:51,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-20 19:18:51,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593906017] [2019-11-20 19:18:51,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 19:18:51,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:18:51,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 19:18:51,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 19:18:51,152 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-20 19:18:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:18:51,342 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-20 19:18:51,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 19:18:51,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 19:18:51,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:18:51,345 INFO L225 Difference]: With dead ends: 108 [2019-11-20 19:18:51,345 INFO L226 Difference]: Without dead ends: 108 [2019-11-20 19:18:51,346 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-20 19:18:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-20 19:18:51,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-20 19:18:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 19:18:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-20 19:18:51,354 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-20 19:18:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:18:51,354 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-20 19:18:51,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 19:18:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-20 19:18:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 19:18:51,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:51,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:18:51,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:18:51,560 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:18:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:18:51,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042753, now seen corresponding path program 1 times [2019-11-20 19:18:51,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:18:51,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [410717320] [2019-11-20 19:18:51,562 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-20 19:18:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:18:51,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 19:18:51,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:18:51,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:18:51,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:51,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:51,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:18:51,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 19:18:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:51,780 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:18:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:51,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [410717320] [2019-11-20 19:18:51,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:18:51,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 19:18:51,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945719944] [2019-11-20 19:18:51,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 19:18:51,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:18:51,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 19:18:51,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 19:18:51,819 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-20 19:18:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:18:52,245 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-20 19:18:52,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 19:18:52,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 19:18:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:18:52,246 INFO L225 Difference]: With dead ends: 107 [2019-11-20 19:18:52,246 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 19:18:52,247 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-20 19:18:52,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 19:18:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 19:18:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 19:18:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-20 19:18:52,256 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-20 19:18:52,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:18:52,256 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-20 19:18:52,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 19:18:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-20 19:18:52,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 19:18:52,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:52,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:18:52,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:18:52,461 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:18:52,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:18:52,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863800, now seen corresponding path program 1 times [2019-11-20 19:18:52,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:18:52,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [934032541] [2019-11-20 19:18:52,463 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-20 19:18:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:18:52,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 19:18:52,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:18:52,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:18:52,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:52,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:52,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:18:52,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 19:18:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:52,666 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:18:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:52,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [934032541] [2019-11-20 19:18:52,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:18:52,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 19:18:52,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165466728] [2019-11-20 19:18:52,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 19:18:52,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:18:52,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 19:18:52,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 19:18:52,678 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-20 19:18:52,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:18:52,834 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-20 19:18:52,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 19:18:52,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 19:18:52,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:18:52,836 INFO L225 Difference]: With dead ends: 105 [2019-11-20 19:18:52,836 INFO L226 Difference]: Without dead ends: 105 [2019-11-20 19:18:52,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 19:18:52,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-20 19:18:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-20 19:18:52,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 19:18:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-20 19:18:52,844 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-20 19:18:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:18:52,845 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-20 19:18:52,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 19:18:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-20 19:18:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 19:18:52,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:52,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:18:53,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:18:53,049 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:18:53,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:18:53,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863801, now seen corresponding path program 1 times [2019-11-20 19:18:53,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:18:53,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [543330356] [2019-11-20 19:18:53,051 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-20 19:18:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:18:53,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 19:18:53,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:18:53,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:18:53,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:53,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:53,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:18:53,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 19:18:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:53,289 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:18:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:53,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [543330356] [2019-11-20 19:18:53,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:18:53,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 19:18:53,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763054735] [2019-11-20 19:18:53,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 19:18:53,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:18:53,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 19:18:53,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 19:18:53,330 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-20 19:18:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:18:53,617 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-20 19:18:53,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 19:18:53,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 19:18:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:18:53,619 INFO L225 Difference]: With dead ends: 106 [2019-11-20 19:18:53,620 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 19:18:53,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 19:18:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 19:18:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-20 19:18:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-20 19:18:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-20 19:18:53,626 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-20 19:18:53,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:18:53,626 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-20 19:18:53,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 19:18:53,626 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-20 19:18:53,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 19:18:53,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:53,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:18:53,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:18:53,830 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:18:53,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:18:53,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021446, now seen corresponding path program 1 times [2019-11-20 19:18:53,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:18:53,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1897115672] [2019-11-20 19:18:53,832 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-20 19:18:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:18:54,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 19:18:54,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:18:54,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:18:54,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:54,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:54,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:18:54,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 19:18:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:54,057 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:18:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:54,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1897115672] [2019-11-20 19:18:54,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:18:54,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-20 19:18:54,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717334451] [2019-11-20 19:18:54,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 19:18:54,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:18:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 19:18:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 19:18:54,128 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-20 19:18:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:18:54,695 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-20 19:18:54,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 19:18:54,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 19:18:54,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:18:54,697 INFO L225 Difference]: With dead ends: 135 [2019-11-20 19:18:54,697 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 19:18:54,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-20 19:18:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 19:18:54,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-20 19:18:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 19:18:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-20 19:18:54,703 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-20 19:18:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:18:54,704 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-20 19:18:54,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 19:18:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-20 19:18:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 19:18:54,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:54,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:18:54,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:18:54,910 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:18:54,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:18:54,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021447, now seen corresponding path program 1 times [2019-11-20 19:18:54,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:18:54,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1623881833] [2019-11-20 19:18:54,912 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-20 19:18:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:18:55,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 19:18:55,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:18:55,135 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:18:55,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:55,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:55,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:18:55,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 19:18:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:55,170 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:18:55,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:18:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:55,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1623881833] [2019-11-20 19:18:55,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:18:55,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 19:18:55,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535237421] [2019-11-20 19:18:55,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 19:18:55,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:18:55,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 19:18:55,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 19:18:55,273 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-20 19:18:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:18:55,890 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-20 19:18:55,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 19:18:55,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 19:18:55,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:18:55,895 INFO L225 Difference]: With dead ends: 109 [2019-11-20 19:18:55,895 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 19:18:55,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 19:18:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 19:18:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-20 19:18:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 19:18:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-20 19:18:55,901 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-20 19:18:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:18:55,905 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-20 19:18:55,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 19:18:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-20 19:18:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 19:18:55,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:55,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:18:56,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:18:56,107 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:18:56,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:18:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774311, now seen corresponding path program 1 times [2019-11-20 19:18:56,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:18:56,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1488719981] [2019-11-20 19:18:56,109 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-20 19:18:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:18:56,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 19:18:56,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:18:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:56,341 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:18:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:56,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1488719981] [2019-11-20 19:18:56,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:18:56,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 19:18:56,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257300443] [2019-11-20 19:18:56,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 19:18:56,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:18:56,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 19:18:56,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 19:18:56,386 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 5 states. [2019-11-20 19:18:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:18:56,821 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-20 19:18:56,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 19:18:56,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-20 19:18:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:18:56,824 INFO L225 Difference]: With dead ends: 135 [2019-11-20 19:18:56,824 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 19:18:56,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 19:18:56,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 19:18:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2019-11-20 19:18:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 19:18:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-11-20 19:18:56,829 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 18 [2019-11-20 19:18:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:18:56,829 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-11-20 19:18:56,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 19:18:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-11-20 19:18:56,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 19:18:56,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:56,830 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:18:57,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:18:57,033 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:18:57,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:18:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774312, now seen corresponding path program 1 times [2019-11-20 19:18:57,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:18:57,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [960874922] [2019-11-20 19:18:57,035 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-20 19:18:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:18:57,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 19:18:57,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:18:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:57,332 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:18:57,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:18:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:57,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [960874922] [2019-11-20 19:18:57,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:18:57,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-20 19:18:57,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973435261] [2019-11-20 19:18:57,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 19:18:57,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:18:57,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 19:18:57,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 19:18:57,426 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 9 states. [2019-11-20 19:18:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:18:58,453 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-20 19:18:58,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 19:18:58,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-20 19:18:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:18:58,455 INFO L225 Difference]: With dead ends: 104 [2019-11-20 19:18:58,455 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 19:18:58,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-20 19:18:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 19:18:58,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 19:18:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 19:18:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-20 19:18:58,460 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-20 19:18:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:18:58,461 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-20 19:18:58,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 19:18:58,461 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-20 19:18:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 19:18:58,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:58,462 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:18:58,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:18:58,665 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:18:58,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:18:58,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1749282988, now seen corresponding path program 1 times [2019-11-20 19:18:58,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:18:58,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [732809444] [2019-11-20 19:18:58,667 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-20 19:18:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:18:58,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 19:18:58,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:18:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:58,897 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:18:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:58,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [732809444] [2019-11-20 19:18:58,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:18:58,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 19:18:58,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026177971] [2019-11-20 19:18:58,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 19:18:58,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:18:58,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 19:18:58,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 19:18:58,912 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-20 19:18:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:18:58,960 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-20 19:18:58,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 19:18:58,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-20 19:18:58,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:18:58,962 INFO L225 Difference]: With dead ends: 112 [2019-11-20 19:18:58,963 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 19:18:58,963 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-20 19:18:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 19:18:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-20 19:18:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 19:18:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-20 19:18:58,967 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-20 19:18:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:18:58,967 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-20 19:18:58,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 19:18:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-20 19:18:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 19:18:58,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:58,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:18:59,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:18:59,171 INFO L410 AbstractCegarLoop]: === Iteration 13 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:18:59,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:18:59,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800861, now seen corresponding path program 1 times [2019-11-20 19:18:59,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:18:59,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1341655238] [2019-11-20 19:18:59,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:18:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:18:59,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 19:18:59,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:18:59,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:18:59,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:59,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:59,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:18:59,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 19:18:59,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 19:18:59,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:59,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:59,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:18:59,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-20 19:18:59,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-20 19:18:59,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:18:59,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:18:59,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:18:59,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-20 19:18:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:59,472 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:18:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:18:59,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1341655238] [2019-11-20 19:18:59,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:18:59,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 19:18:59,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758045682] [2019-11-20 19:18:59,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 19:18:59,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:18:59,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 19:18:59,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 19:18:59,490 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 5 states. [2019-11-20 19:18:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:18:59,881 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-20 19:18:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 19:18:59,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-20 19:18:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:18:59,883 INFO L225 Difference]: With dead ends: 114 [2019-11-20 19:18:59,883 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 19:18:59,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 19:18:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 19:18:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-20 19:18:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 19:18:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-11-20 19:18:59,888 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 19 [2019-11-20 19:18:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:18:59,888 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-11-20 19:18:59,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 19:18:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-11-20 19:18:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 19:18:59,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:18:59,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:19:00,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:19:00,092 INFO L410 AbstractCegarLoop]: === Iteration 14 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:19:00,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:19:00,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800860, now seen corresponding path program 1 times [2019-11-20 19:19:00,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:19:00,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1964237615] [2019-11-20 19:19:00,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:19:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:19:00,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 19:19:00,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:19:00,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:19:00,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:00,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:00,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:19:00,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 19:19:00,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 19:19:00,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:00,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:00,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 19:19:00,368 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:00,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:00,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:19:00,379 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-20 19:19:00,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-20 19:19:00,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:00,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:00,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 19:19:00,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:00,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:00,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:19:00,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-20 19:19:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:19:00,474 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:19:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:19:00,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1964237615] [2019-11-20 19:19:00,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:19:00,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 19:19:00,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563704940] [2019-11-20 19:19:00,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 19:19:00,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:19:00,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 19:19:00,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 19:19:00,791 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 10 states. [2019-11-20 19:19:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:19:02,499 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-20 19:19:02,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 19:19:02,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-20 19:19:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:19:02,501 INFO L225 Difference]: With dead ends: 113 [2019-11-20 19:19:02,501 INFO L226 Difference]: Without dead ends: 113 [2019-11-20 19:19:02,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-20 19:19:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-20 19:19:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-11-20 19:19:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 19:19:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-20 19:19:02,506 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2019-11-20 19:19:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:19:02,506 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-20 19:19:02,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 19:19:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-20 19:19:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 19:19:02,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:19:02,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:19:02,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:19:02,710 INFO L410 AbstractCegarLoop]: === Iteration 15 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:19:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:19:02,711 INFO L82 PathProgramCache]: Analyzing trace with hash -195954174, now seen corresponding path program 1 times [2019-11-20 19:19:02,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:19:02,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [873845579] [2019-11-20 19:19:02,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:19:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:19:02,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 19:19:02,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:19:02,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:19:02,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:03,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:03,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:19:03,005 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:03,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:03,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:19:03,011 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 19:19:03,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 19:19:03,065 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 12 treesize of output 14 [2019-11-20 19:19:03,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:03,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:03,089 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:03,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 19:19:03,090 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:03,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:03,102 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-20 19:19:03,102 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-11-20 19:19:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:19:03,133 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:19:03,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:19:03,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:03,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:19:03,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:03,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:03,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:03,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:19:03,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:03,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:08,041 WARN L192 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 19:19:08,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:19:10,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [873845579] [2019-11-20 19:19:10,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:19:10,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 19:19:10,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633998582] [2019-11-20 19:19:10,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 19:19:10,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:19:10,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 19:19:10,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-20 19:19:10,579 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 10 states. [2019-11-20 19:19:16,743 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|create_data_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store |c_old(#length)| |create_data_#t~malloc3.base| (_ bv8 32)) |c_#length|))) (= c_append_~node~0.offset (_ bv0 32)) (= (bvadd (select |c_#length| c_append_~node~0.base) (_ bv4294967288 32)) (_ bv0 32)) (forall ((v_append_~node~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (|v_create_data_#t~malloc3.base_7| (_ BitVec 32)) (v_append_~node~0.base_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)))) (or (not (bvsle v_append_~node~0.offset_BEFORE_CALL_4 .cse0)) (exists ((|v_create_data_#t~malloc3.base_6| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_create_data_#t~malloc3.base_6|) (_ bv0 1)) (not (bvsle (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |c_old(#length)| |v_create_data_#t~malloc3.base_6| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6))))) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_7| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6)) (not (bvsle (_ bv0 32) v_append_~node~0.offset_BEFORE_CALL_4)) (not (= (_ bv0 1) (select |c_#valid| |v_create_data_#t~malloc3.base_7|)))))) (= (_ bv1 1) (select |c_#valid| c_append_~node~0.base))) is different from false [2019-11-20 19:19:20,976 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|create_data_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= (store |c_old(#length)| |create_data_#t~malloc3.base| (_ bv8 32)) |c_#length|))) (forall ((v_append_~node~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (|v_create_data_#t~malloc3.base_7| (_ BitVec 32)) (v_append_~node~0.base_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)))) (or (not (bvsle v_append_~node~0.offset_BEFORE_CALL_4 .cse0)) (exists ((|v_create_data_#t~malloc3.base_6| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_create_data_#t~malloc3.base_6|) (_ bv0 1)) (not (bvsle (bvadd v_append_~node~0.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |c_old(#length)| |v_create_data_#t~malloc3.base_6| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6))))) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_7| (_ bv8 32)) v_append_~node~0.base_BEFORE_CALL_6)) (not (bvsle (_ bv0 32) v_append_~node~0.offset_BEFORE_CALL_4)) (not (= (_ bv0 1) (select |c_#valid| |v_create_data_#t~malloc3.base_7|))))))) is different from false [2019-11-20 19:19:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:19:35,669 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2019-11-20 19:19:35,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 19:19:35,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 19:19:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:19:35,671 INFO L225 Difference]: With dead ends: 129 [2019-11-20 19:19:35,671 INFO L226 Difference]: Without dead ends: 129 [2019-11-20 19:19:35,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=40, Invalid=97, Unknown=3, NotChecked=42, Total=182 [2019-11-20 19:19:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-20 19:19:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2019-11-20 19:19:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 19:19:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-11-20 19:19:35,677 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2019-11-20 19:19:35,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:19:35,677 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-11-20 19:19:35,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 19:19:35,678 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-11-20 19:19:35,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 19:19:35,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:19:35,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:19:35,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:19:35,882 INFO L410 AbstractCegarLoop]: === Iteration 16 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:19:35,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:19:35,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780014, now seen corresponding path program 1 times [2019-11-20 19:19:35,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:19:35,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [43004823] [2019-11-20 19:19:35,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:19:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:19:36,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 19:19:36,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:19:36,111 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-20 19:19:36,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:36,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:36,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:19:36,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-20 19:19:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:19:36,134 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:19:36,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:36,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2019-11-20 19:19:36,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:36,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:36,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:36,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:19:36,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-20 19:19:36,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-11-20 19:19:36,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:36,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:36,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:19:36,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-20 19:19:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:19:36,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [43004823] [2019-11-20 19:19:36,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:19:36,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 19:19:36,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438155216] [2019-11-20 19:19:36,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 19:19:36,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:19:36,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 19:19:36,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 19:19:36,226 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 5 states. [2019-11-20 19:19:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:19:36,581 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-20 19:19:36,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 19:19:36,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-20 19:19:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:19:36,584 INFO L225 Difference]: With dead ends: 112 [2019-11-20 19:19:36,584 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 19:19:36,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 19:19:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 19:19:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-11-20 19:19:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 19:19:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-20 19:19:36,589 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 22 [2019-11-20 19:19:36,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:19:36,590 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-20 19:19:36,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 19:19:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-20 19:19:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 19:19:36,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:19:36,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:19:36,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:19:36,792 INFO L410 AbstractCegarLoop]: === Iteration 17 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:19:36,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:19:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780013, now seen corresponding path program 1 times [2019-11-20 19:19:36,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:19:36,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [727332592] [2019-11-20 19:19:36,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:19:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:19:37,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 19:19:37,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:19:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:19:37,088 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:19:37,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:19:37,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 19:19:37,226 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 19:19:37,231 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 12 treesize of output 10 [2019-11-20 19:19:37,231 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 19:19:37,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:37,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 19:19:37,266 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-20 19:19:37,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:37,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-11-20 19:19:37,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:37,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:37,461 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 19:19:37,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:37,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:37,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 19:19:37,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-20 19:19:37,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:37,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:37,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:37,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:38,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:38,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:38,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:19:38,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [727332592] [2019-11-20 19:19:38,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:19:38,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 19:19:38,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660654445] [2019-11-20 19:19:38,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 19:19:38,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:19:38,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 19:19:38,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 19:19:38,360 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 10 states. [2019-11-20 19:19:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:19:38,893 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-20 19:19:38,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 19:19:38,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-20 19:19:38,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:19:38,896 INFO L225 Difference]: With dead ends: 106 [2019-11-20 19:19:38,896 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 19:19:38,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-20 19:19:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 19:19:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-20 19:19:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 19:19:38,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-20 19:19:38,901 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 22 [2019-11-20 19:19:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:19:38,902 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-20 19:19:38,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 19:19:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-20 19:19:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 19:19:38,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:19:38,903 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:19:39,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:19:39,107 INFO L410 AbstractCegarLoop]: === Iteration 18 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:19:39,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:19:39,108 INFO L82 PathProgramCache]: Analyzing trace with hash 666602723, now seen corresponding path program 1 times [2019-11-20 19:19:39,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:19:39,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1228361736] [2019-11-20 19:19:39,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:19:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:19:39,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 19:19:39,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:19:39,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:19:39,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:39,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:39,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:19:39,387 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:39,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:39,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:19:39,402 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 19:19:39,441 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:39,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 19:19:39,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:39,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:39,459 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 12 treesize of output 14 [2019-11-20 19:19:39,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:39,478 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-20 19:19:39,479 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-20 19:19:39,479 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-20 19:19:39,586 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_old(#length)_AFTER_CALL_46|]} [2019-11-20 19:19:39,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:39,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 19:19:39,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:39,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:39,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:39,669 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 44 [2019-11-20 19:19:39,670 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:39,709 INFO L567 ElimStorePlain]: treesize reduction 22, result has 48.8 percent of original size [2019-11-20 19:19:39,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 19:19:39,710 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:21 [2019-11-20 19:19:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:19:39,727 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:19:39,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:19:39,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:39,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:39,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:19:39,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:19:39,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:39,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:19:39,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:19:43,316 WARN L192 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 19:19:43,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:19:45,640 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-20 19:19:45,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:19:45,787 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:45,788 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 19:19:45,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:19:45,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:19:45,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 19:19:45,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-20 19:19:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:19:46,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1228361736] [2019-11-20 19:19:46,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:19:46,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2019-11-20 19:19:46,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332042987] [2019-11-20 19:19:46,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 19:19:46,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:19:46,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 19:19:46,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=170, Unknown=1, NotChecked=0, Total=210 [2019-11-20 19:19:46,180 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 15 states. [2019-11-20 19:20:39,325 WARN L192 SmtUtils]: Spent 42.68 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-20 19:21:04,248 WARN L192 SmtUtils]: Spent 4.08 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-20 19:22:17,538 WARN L192 SmtUtils]: Spent 16.23 s on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 19:22:29,947 WARN L192 SmtUtils]: Spent 6.13 s on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-20 19:22:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:22:54,607 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2019-11-20 19:22:54,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 19:22:54,609 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-20 19:22:54,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:22:54,611 INFO L225 Difference]: With dead ends: 166 [2019-11-20 19:22:54,611 INFO L226 Difference]: Without dead ends: 166 [2019-11-20 19:22:54,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 133.4s TimeCoverageRelationStatistics Valid=130, Invalid=444, Unknown=26, NotChecked=0, Total=600 [2019-11-20 19:22:54,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-20 19:22:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 136. [2019-11-20 19:22:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-20 19:22:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2019-11-20 19:22:54,625 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 22 [2019-11-20 19:22:54,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:22:54,626 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2019-11-20 19:22:54,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 19:22:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2019-11-20 19:22:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 19:22:54,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:22:54,627 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:22:54,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:22:54,830 INFO L410 AbstractCegarLoop]: === Iteration 19 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:22:54,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:22:54,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1559284308, now seen corresponding path program 1 times [2019-11-20 19:22:54,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:22:54,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [700211252] [2019-11-20 19:22:54,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:22:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:22:55,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 19:22:55,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:22:55,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:22:55,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:55,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:55,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:22:55,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 19:22:55,129 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:55,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-20 19:22:55,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:55,153 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-20 19:22:55,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:22:55,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-20 19:22:55,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 19:22:55,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:55,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:55,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:22:55,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2019-11-20 19:22:55,280 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:55,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 89 [2019-11-20 19:22:55,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:22:55,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:22:55,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:22:55,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:22:55,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 19:22:55,330 INFO L567 ElimStorePlain]: treesize reduction 83, result has 27.2 percent of original size [2019-11-20 19:22:55,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:22:55,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:31 [2019-11-20 19:22:55,345 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 33 treesize of output 15 [2019-11-20 19:22:55,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:55,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:55,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 19:22:55,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:19 [2019-11-20 19:22:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 19:22:55,372 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:22:55,400 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 19:22:55,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:55,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 19:22:55,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:23 [2019-11-20 19:22:56,277 WARN L192 SmtUtils]: Spent 732.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-20 19:22:56,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:56,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:56,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:22:56,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 19:22:56,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:24 [2019-11-20 19:22:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:22:56,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [700211252] [2019-11-20 19:22:56,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 19:22:56,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2019-11-20 19:22:56,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135925447] [2019-11-20 19:22:56,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 19:22:56,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:22:56,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 19:22:56,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-20 19:22:56,413 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand 13 states. [2019-11-20 19:22:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:22:57,440 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2019-11-20 19:22:57,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 19:22:57,441 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-11-20 19:22:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:22:57,443 INFO L225 Difference]: With dead ends: 135 [2019-11-20 19:22:57,443 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 19:22:57,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-20 19:22:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 19:22:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-20 19:22:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-20 19:22:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2019-11-20 19:22:57,449 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 24 [2019-11-20 19:22:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:22:57,450 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2019-11-20 19:22:57,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 19:22:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2019-11-20 19:22:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 19:22:57,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:22:57,451 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:22:57,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:22:57,654 INFO L410 AbstractCegarLoop]: === Iteration 20 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:22:57,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:22:57,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1559284309, now seen corresponding path program 1 times [2019-11-20 19:22:57,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:22:57,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [462103255] [2019-11-20 19:22:57,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:22:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:22:57,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 19:22:57,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:22:57,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:22:57,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:57,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:57,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:22:57,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 19:22:57,973 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_122|], 1=[|v_#valid_205|]} [2019-11-20 19:22:57,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:22:57,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:57,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:57,997 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:57,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 19:22:57,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:58,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:58,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:22:58,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-11-20 19:22:58,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 19:22:58,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:58,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:58,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 19:22:58,066 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:58,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:58,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:22:58,081 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:33 [2019-11-20 19:22:58,176 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 51 treesize of output 13 [2019-11-20 19:22:58,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:58,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:58,269 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:58,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 89 [2019-11-20 19:22:58,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:22:58,270 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:58,306 INFO L567 ElimStorePlain]: treesize reduction 44, result has 45.0 percent of original size [2019-11-20 19:22:58,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:22:58,306 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:118, output treesize:36 [2019-11-20 19:22:58,345 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 33 treesize of output 15 [2019-11-20 19:22:58,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:58,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:58,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 19:22:58,368 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:58,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:58,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:22:58,379 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:16 [2019-11-20 19:22:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:22:58,404 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:22:58,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:22:58,778 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 19:22:58,788 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 19:22:58,805 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-20 19:22:59,062 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 19:22:59,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:59,075 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-20 19:22:59,110 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:59,121 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 19:22:59,231 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 19:22:59,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:22:59,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2019-11-20 19:22:59,232 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:209, output treesize:122 [2019-11-20 19:23:05,353 WARN L192 SmtUtils]: Spent 854.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 19:23:09,431 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 19:23:11,941 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 19:23:11,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:12,360 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-20 19:23:12,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:12,388 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:12,706 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 19:23:12,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:12,717 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:12,999 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-20 19:23:13,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:13,009 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:13,494 WARN L192 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-11-20 19:23:13,495 INFO L567 ElimStorePlain]: treesize reduction 58, result has 64.4 percent of original size [2019-11-20 19:23:13,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:23:13,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:23:13,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:23:13,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:23:13,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2019-11-20 19:23:13,503 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:190, output treesize:56 [2019-11-20 19:23:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:23:13,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [462103255] [2019-11-20 19:23:13,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 19:23:13,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-20 19:23:13,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499181901] [2019-11-20 19:23:13,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 19:23:13,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:23:13,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 19:23:13,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=189, Unknown=2, NotChecked=0, Total=240 [2019-11-20 19:23:13,715 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand 16 states. [2019-11-20 19:23:16,040 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-11-20 19:23:20,940 WARN L192 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-11-20 19:23:25,090 WARN L192 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 120 DAG size of output: 75 [2019-11-20 19:23:32,252 WARN L192 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2019-11-20 19:23:33,010 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 19:23:34,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:23:34,258 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2019-11-20 19:23:34,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 19:23:34,258 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2019-11-20 19:23:34,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:23:34,260 INFO L225 Difference]: With dead ends: 157 [2019-11-20 19:23:34,260 INFO L226 Difference]: Without dead ends: 157 [2019-11-20 19:23:34,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=217, Invalid=537, Unknown=2, NotChecked=0, Total=756 [2019-11-20 19:23:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-20 19:23:34,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 147. [2019-11-20 19:23:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-20 19:23:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2019-11-20 19:23:34,268 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 167 transitions. Word has length 24 [2019-11-20 19:23:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:23:34,268 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 167 transitions. [2019-11-20 19:23:34,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 19:23:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 167 transitions. [2019-11-20 19:23:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 19:23:34,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:23:34,269 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:23:34,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:23:34,471 INFO L410 AbstractCegarLoop]: === Iteration 21 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:23:34,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:23:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1555181715, now seen corresponding path program 1 times [2019-11-20 19:23:34,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:23:34,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [534409623] [2019-11-20 19:23:34,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:23:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:23:34,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 19:23:34,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:23:34,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 19:23:34,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:34,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:34,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:23:34,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-20 19:23:34,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-20 19:23:34,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:34,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:34,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:23:34,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-20 19:23:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:23:34,759 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:23:34,911 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 30 treesize of output 26 [2019-11-20 19:23:34,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 19:23:34,944 INFO L567 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2019-11-20 19:23:34,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 19:23:34,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2019-11-20 19:23:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:23:34,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [534409623] [2019-11-20 19:23:34,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:23:34,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 8 [2019-11-20 19:23:34,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142465978] [2019-11-20 19:23:34,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 19:23:34,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:23:34,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 19:23:34,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 19:23:34,961 INFO L87 Difference]: Start difference. First operand 147 states and 167 transitions. Second operand 8 states. [2019-11-20 19:23:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:23:35,606 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2019-11-20 19:23:35,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 19:23:35,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-20 19:23:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:23:35,608 INFO L225 Difference]: With dead ends: 174 [2019-11-20 19:23:35,608 INFO L226 Difference]: Without dead ends: 174 [2019-11-20 19:23:35,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 19:23:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-20 19:23:35,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 149. [2019-11-20 19:23:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 19:23:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 168 transitions. [2019-11-20 19:23:35,618 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 168 transitions. Word has length 25 [2019-11-20 19:23:35,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:23:35,618 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 168 transitions. [2019-11-20 19:23:35,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 19:23:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 168 transitions. [2019-11-20 19:23:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 19:23:35,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:23:35,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:23:35,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:23:35,832 INFO L410 AbstractCegarLoop]: === Iteration 22 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:23:35,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:23:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1555182679, now seen corresponding path program 1 times [2019-11-20 19:23:35,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:23:35,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1131303385] [2019-11-20 19:23:35,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:23:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:23:36,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 19:23:36,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:23:36,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:23:36,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:36,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:36,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:23:36,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-20 19:23:36,127 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 19:23:36,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:36,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:36,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:23:36,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-11-20 19:23:36,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 19:23:36,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:36,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:36,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 19:23:36,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-11-20 19:23:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:23:36,231 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:23:36,479 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 36 treesize of output 32 [2019-11-20 19:23:36,481 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 19:23:36,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:36,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 19:23:36,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2019-11-20 19:23:36,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:23:36,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:23:36,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:23:36,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:23:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:23:36,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1131303385] [2019-11-20 19:23:36,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:23:36,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-20 19:23:36,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006774815] [2019-11-20 19:23:36,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 19:23:36,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:23:36,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 19:23:36,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-20 19:23:36,918 INFO L87 Difference]: Start difference. First operand 149 states and 168 transitions. Second operand 14 states. [2019-11-20 19:23:38,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:23:38,675 INFO L93 Difference]: Finished difference Result 176 states and 199 transitions. [2019-11-20 19:23:38,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 19:23:38,678 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-11-20 19:23:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:23:38,679 INFO L225 Difference]: With dead ends: 176 [2019-11-20 19:23:38,679 INFO L226 Difference]: Without dead ends: 176 [2019-11-20 19:23:38,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2019-11-20 19:23:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-20 19:23:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 147. [2019-11-20 19:23:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-20 19:23:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2019-11-20 19:23:38,686 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 25 [2019-11-20 19:23:38,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:23:38,686 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2019-11-20 19:23:38,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 19:23:38,686 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2019-11-20 19:23:38,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 19:23:38,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:23:38,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:23:38,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:23:38,891 INFO L410 AbstractCegarLoop]: === Iteration 23 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:23:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:23:38,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1555182680, now seen corresponding path program 1 times [2019-11-20 19:23:38,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:23:38,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1411968533] [2019-11-20 19:23:38,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:23:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:23:39,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 19:23:39,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:23:39,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:23:39,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:39,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:39,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:23:39,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-20 19:23:39,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 19:23:39,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:39,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:39,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 19:23:39,195 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:39,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:39,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:23:39,205 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2019-11-20 19:23:39,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 19:23:39,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:39,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:39,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 19:23:39,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:39,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:39,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:23:39,267 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-11-20 19:23:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:23:39,286 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:23:39,824 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 60 treesize of output 56 [2019-11-20 19:23:39,825 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 19:23:39,958 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 19:23:39,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:39,978 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-11-20 19:23:39,980 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-20 19:23:40,060 INFO L567 ElimStorePlain]: treesize reduction 37, result has 57.5 percent of original size [2019-11-20 19:23:40,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 19:23:40,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 19:23:40,069 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:40,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:40,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 19:23:40,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 19:23:40,115 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:40,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:40,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-11-20 19:23:40,143 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:26 [2019-11-20 19:23:40,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:23:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:23:40,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1411968533] [2019-11-20 19:23:40,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 19:23:40,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2019-11-20 19:23:40,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253813915] [2019-11-20 19:23:40,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 19:23:40,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 19:23:40,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 19:23:40,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-20 19:23:40,312 INFO L87 Difference]: Start difference. First operand 147 states and 165 transitions. Second operand 13 states. [2019-11-20 19:23:42,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 19:23:42,525 INFO L93 Difference]: Finished difference Result 180 states and 206 transitions. [2019-11-20 19:23:42,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 19:23:42,526 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-11-20 19:23:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 19:23:42,527 INFO L225 Difference]: With dead ends: 180 [2019-11-20 19:23:42,527 INFO L226 Difference]: Without dead ends: 180 [2019-11-20 19:23:42,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-20 19:23:42,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-20 19:23:42,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 152. [2019-11-20 19:23:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-20 19:23:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 171 transitions. [2019-11-20 19:23:42,535 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 171 transitions. Word has length 25 [2019-11-20 19:23:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 19:23:42,536 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 171 transitions. [2019-11-20 19:23:42,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 19:23:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 171 transitions. [2019-11-20 19:23:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 19:23:42,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 19:23:42,537 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 19:23:42,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:23:42,741 INFO L410 AbstractCegarLoop]: === Iteration 24 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-20 19:23:42,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 19:23:42,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1484151444, now seen corresponding path program 1 times [2019-11-20 19:23:42,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 19:23:42,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1850898194] [2019-11-20 19:23:42,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:23:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 19:23:43,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 19:23:43,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 19:23:43,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:23:43,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:43,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:43,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 19:23:43,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:43,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:43,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 19:23:43,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 19:23:43,231 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:43,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 19:23:43,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:43,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:43,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 19:23:43,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:22 [2019-11-20 19:23:43,334 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_BEFORE_CALL_22|], 2=[|v_old(#length)_AFTER_CALL_65|]} [2019-11-20 19:23:43,346 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:43,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 19:23:43,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:43,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:43,385 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 19:23:43,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-20 19:23:43,386 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:43,417 INFO L567 ElimStorePlain]: treesize reduction 8, result has 76.5 percent of original size [2019-11-20 19:23:43,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 19:23:43,418 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:26 [2019-11-20 19:23:43,514 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_256|], 3=[|v_#length_160|]} [2019-11-20 19:23:43,525 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:43,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 19:23:43,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:43,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:43,589 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:43,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 44 [2019-11-20 19:23:43,590 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:43,631 INFO L567 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-11-20 19:23:43,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 19:23:43,632 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:21 [2019-11-20 19:23:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 19:23:43,686 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 19:23:43,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:23:44,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:23:44,276 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_96|], 6=[|v_#valid_269|]} [2019-11-20 19:23:44,321 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:44,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2019-11-20 19:23:44,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:44,343 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:44,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2019-11-20 19:23:44,344 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:44,368 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:44,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 55 [2019-11-20 19:23:44,369 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:44,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:44,472 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:44,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2019-11-20 19:23:44,473 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:44,489 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:44,489 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 19:23:44,490 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:44,512 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:44,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2019-11-20 19:23:44,514 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 19:23:44,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 19:23:44,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-11-20 19:23:44,580 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:130, output treesize:52 [2019-11-20 19:23:44,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:23:44,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:23:44,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:23:44,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:23:44,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:23:44,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:23:44,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 19:23:44,777 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-20 19:23:44,784 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-20 19:23:47,305 WARN L192 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-20 19:23:47,308 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 19:23:47,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 19:23:47,312 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-20 19:23:47,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 19:23:47,519 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 19:23:47,525 INFO L168 Benchmark]: Toolchain (without parser) took 305396.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 244.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 11.5 GB. [2019-11-20 19:23:47,526 INFO L168 Benchmark]: CDTParser took 0.94 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 19:23:47,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 582.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-20 19:23:47,527 INFO L168 Benchmark]: Boogie Preprocessor took 71.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 19:23:47,527 INFO L168 Benchmark]: RCFGBuilder took 995.37 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: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. [2019-11-20 19:23:47,527 INFO L168 Benchmark]: TraceAbstraction took 303742.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -92.3 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-11-20 19:23:47,529 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.94 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 582.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.58 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 995.37 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: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 303742.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -92.3 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...