./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 264dba86 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 --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-264dba8 [2019-11-21 12:57:52,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 12:57:52,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 12:57:52,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 12:57:52,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 12:57:52,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 12:57:52,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 12:57:52,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 12:57:52,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 12:57:52,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 12:57:52,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 12:57:52,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 12:57:52,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 12:57:52,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 12:57:52,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 12:57:52,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 12:57:52,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 12:57:52,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 12:57:52,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 12:57:52,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 12:57:52,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 12:57:52,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 12:57:52,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 12:57:52,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 12:57:52,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 12:57:52,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 12:57:52,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 12:57:52,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 12:57:52,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 12:57:52,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 12:57:52,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 12:57:52,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 12:57:52,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 12:57:52,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 12:57:52,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 12:57:52,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 12:57:52,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 12:57:52,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 12:57:52,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 12:57:52,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 12:57:52,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 12:57:52,791 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 12:57:52,806 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 12:57:52,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 12:57:52,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 12:57:52,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 12:57:52,809 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 12:57:52,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 12:57:52,809 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 12:57:52,810 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 12:57:52,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 12:57:52,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 12:57:52,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 12:57:52,811 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 12:57:52,811 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 12:57:52,811 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 12:57:52,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 12:57:52,812 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 12:57:52,812 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 12:57:52,812 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 12:57:52,813 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 12:57:52,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 12:57:52,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 12:57:52,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 12:57:52,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 12:57:52,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 12:57:52,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 12:57:52,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 12:57:52,815 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 12:57:52,815 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 12:57:52,816 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 12:57:52,816 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 12:57:53,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 12:57:53,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 12:57:53,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 12:57:53,152 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 12:57:53,154 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 12:57:53,155 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-21 12:57:53,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc43fd92/da36353d296b4ee0a9f198385d2adecb/FLAG715c87657 [2019-11-21 12:57:53,757 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 12:57:53,757 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-21 12:57:53,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc43fd92/da36353d296b4ee0a9f198385d2adecb/FLAG715c87657 [2019-11-21 12:57:54,115 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc43fd92/da36353d296b4ee0a9f198385d2adecb [2019-11-21 12:57:54,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 12:57:54,120 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 12:57:54,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 12:57:54,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 12:57:54,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 12:57:54,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:57:54" (1/1) ... [2019-11-21 12:57:54,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b4f2291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:57:54, skipping insertion in model container [2019-11-21 12:57:54,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:57:54" (1/1) ... [2019-11-21 12:57:54,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 12:57:54,180 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:57:54,551 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:57:54,552 INFO L969 CHandler]: at location: C: (int*) malloc(20 * sizeof(data->array)) [544] [2019-11-21 12:57:54,552 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:57:54,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:57:54,582 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 12:57:54,591 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:57:54,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:57:54,649 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 12:57:54,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:57:54,760 INFO L205 MainTranslator]: Completed translation [2019-11-21 12:57:54,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:57:54 WrapperNode [2019-11-21 12:57:54,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 12:57:54,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 12:57:54,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 12:57:54,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 12:57:54,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:57:54" (1/1) ... [2019-11-21 12:57:54,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:57:54" (1/1) ... [2019-11-21 12:57:54,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:57:54" (1/1) ... [2019-11-21 12:57:54,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:57:54" (1/1) ... [2019-11-21 12:57:54,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:57:54" (1/1) ... [2019-11-21 12:57:54,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:57:54" (1/1) ... [2019-11-21 12:57:54,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:57:54" (1/1) ... [2019-11-21 12:57:54,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 12:57:54,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 12:57:54,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 12:57:54,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 12:57:54,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:57:54" (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-21 12:57:54,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 12:57:54,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 12:57:54,907 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 12:57:54,907 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 12:57:54,907 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-21 12:57:54,908 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-21 12:57:54,908 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-21 12:57:54,908 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 12:57:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 12:57:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 12:57:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 12:57:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 12:57:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 12:57:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 12:57:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 12:57:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 12:57:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 12:57:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 12:57:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 12:57:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 12:57:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 12:57:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 12:57:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 12:57:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 12:57:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 12:57:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 12:57:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 12:57:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 12:57:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 12:57:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 12:57:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 12:57:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 12:57:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 12:57:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 12:57:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 12:57:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 12:57:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 12:57:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 12:57:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 12:57:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 12:57:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 12:57:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 12:57:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 12:57:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 12:57:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 12:57:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 12:57:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 12:57:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 12:57:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 12:57:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 12:57:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 12:57:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 12:57:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 12:57:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 12:57:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 12:57:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 12:57:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 12:57:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 12:57:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 12:57:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 12:57:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 12:57:54,918 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 12:57:54,918 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 12:57:54,918 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 12:57:54,919 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 12:57:54,919 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 12:57:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 12:57:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 12:57:54,922 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 12:57:54,922 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 12:57:54,922 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 12:57:54,922 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 12:57:54,922 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 12:57:54,923 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 12:57:54,923 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 12:57:54,924 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 12:57:54,924 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 12:57:54,924 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 12:57:54,924 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 12:57:54,924 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 12:57:54,924 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 12:57:54,924 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 12:57:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 12:57:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 12:57:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 12:57:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 12:57:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 12:57:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 12:57:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 12:57:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 12:57:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 12:57:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 12:57:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 12:57:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 12:57:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 12:57:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 12:57:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 12:57:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 12:57:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 12:57:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 12:57:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 12:57:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 12:57:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 12:57:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 12:57:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 12:57:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 12:57:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 12:57:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 12:57:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 12:57:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 12:57:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 12:57:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 12:57:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 12:57:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 12:57:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 12:57:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-21 12:57:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 12:57:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 12:57:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 12:57:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 12:57:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-21 12:57:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 12:57:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-21 12:57:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 12:57:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 12:57:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 12:57:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 12:57:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 12:57:54,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 12:57:55,797 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 12:57:55,798 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-21 12:57:55,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:57:55 BoogieIcfgContainer [2019-11-21 12:57:55,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 12:57:55,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 12:57:55,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 12:57:55,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 12:57:55,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:57:54" (1/3) ... [2019-11-21 12:57:55,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d8476b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:57:55, skipping insertion in model container [2019-11-21 12:57:55,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:57:54" (2/3) ... [2019-11-21 12:57:55,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d8476b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:57:55, skipping insertion in model container [2019-11-21 12:57:55,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:57:55" (3/3) ... [2019-11-21 12:57:55,808 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-21 12:57:55,819 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 12:57:55,827 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-21 12:57:55,839 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-21 12:57:55,862 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 12:57:55,862 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 12:57:55,862 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 12:57:55,862 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 12:57:55,863 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 12:57:55,863 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 12:57:55,863 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 12:57:55,863 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 12:57:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-21 12:57:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 12:57:55,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:57:55,894 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:57:55,895 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-21 12:57:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:57:55,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1597989777, now seen corresponding path program 1 times [2019-11-21 12:57:55,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:57:55,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [633342771] [2019-11-21 12:57:55,914 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-21 12:57:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:57:56,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-21 12:57:56,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:57:56,161 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-21 12:57:56,162 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:57:56,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-21 12:57:56,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [633342771] [2019-11-21 12:57:56,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:57:56,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 12:57:56,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209912540] [2019-11-21 12:57:56,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-21 12:57:56,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:57:56,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-21 12:57:56,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 12:57:56,201 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-21 12:57:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:57:56,223 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-21 12:57:56,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-21 12:57:56,225 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-21 12:57:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:57:56,236 INFO L225 Difference]: With dead ends: 110 [2019-11-21 12:57:56,237 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 12:57:56,238 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-21 12:57:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 12:57:56,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 12:57:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 12:57:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-21 12:57:56,287 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-21 12:57:56,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:57:56,288 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-21 12:57:56,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-21 12:57:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-21 12:57:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 12:57:56,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:57:56,289 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:57:56,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:57:56,492 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-21 12:57:56,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:57:56,493 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857581, now seen corresponding path program 1 times [2019-11-21 12:57:56,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:57:56,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [901903010] [2019-11-21 12:57:56,494 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-21 12:57:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:57:56,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:57:56,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:57:56,765 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-21 12:57:56,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:56,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:56,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:57:56,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:57:56,835 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:56,836 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-21 12:57:56,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:56,869 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 12:57:56,870 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-21 12:57:56,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-21 12:57:56,894 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-21 12:57:56,894 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:57:56,930 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-21 12:57:56,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [901903010] [2019-11-21 12:57:56,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:57:56,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 12:57:56,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282720713] [2019-11-21 12:57:56,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:57:56,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:57:56,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:57:56,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:57:56,934 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2019-11-21 12:57:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:57:57,468 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-21 12:57:57,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:57:57,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-21 12:57:57,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:57:57,478 INFO L225 Difference]: With dead ends: 116 [2019-11-21 12:57:57,480 INFO L226 Difference]: Without dead ends: 116 [2019-11-21 12:57:57,481 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-21 12:57:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-21 12:57:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-21 12:57:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 12:57:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-21 12:57:57,515 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-21 12:57:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:57:57,521 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-21 12:57:57,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:57:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-21 12:57:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 12:57:57,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:57:57,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:57:57,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:57:57,727 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-21 12:57:57,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:57:57,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2001857580, now seen corresponding path program 1 times [2019-11-21 12:57:57,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:57:57,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [575454848] [2019-11-21 12:57:57,729 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-21 12:57:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:57:57,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 12:57:57,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:57:57,980 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-21 12:57:57,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:57,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:57,997 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-21 12:57:57,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:58,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:58,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:57:58,012 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 12:57:58,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:57:58,072 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-21 12:57:58,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:58,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:58,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:57:58,095 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-21 12:57:58,096 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:57:58,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:57:58,114 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-21 12:57:58,114 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-21 12:57:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:57:58,147 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:57:58,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:57:58,477 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-21 12:57:58,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [575454848] [2019-11-21 12:57:58,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:57:58,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 12:57:58,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064167744] [2019-11-21 12:57:58,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 12:57:58,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:57:58,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 12:57:58,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 12:57:58,480 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-21 12:58:00,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:00,185 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-21 12:58:00,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 12:58:00,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 12:58:00,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:00,187 INFO L225 Difference]: With dead ends: 115 [2019-11-21 12:58:00,188 INFO L226 Difference]: Without dead ends: 115 [2019-11-21 12:58:00,188 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-21 12:58:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-21 12:58:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-21 12:58:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 12:58:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-21 12:58:00,197 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-21 12:58:00,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:00,197 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-21 12:58:00,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 12:58:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-21 12:58:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 12:58:00,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:00,198 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:00,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:00,401 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-21 12:58:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:00,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042754, now seen corresponding path program 1 times [2019-11-21 12:58:00,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:00,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [674285016] [2019-11-21 12:58:00,404 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-21 12:58:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:00,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 12:58:00,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:00,594 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-21 12:58:00,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:00,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:00,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:00,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:58:00,609 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-21 12:58:00,610 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:58:00,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [674285016] [2019-11-21 12:58:00,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:00,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-21 12:58:00,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684781054] [2019-11-21 12:58:00,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 12:58:00,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:00,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 12:58:00,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:58:00,634 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-21 12:58:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:00,856 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-21 12:58:00,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:58:00,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 12:58:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:00,858 INFO L225 Difference]: With dead ends: 108 [2019-11-21 12:58:00,858 INFO L226 Difference]: Without dead ends: 108 [2019-11-21 12:58:00,859 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-21 12:58:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-21 12:58:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-21 12:58:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 12:58:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-21 12:58:00,868 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-21 12:58:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:00,868 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-21 12:58:00,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 12:58:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-21 12:58:00,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 12:58:00,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:00,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:01,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:01,089 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-21 12:58:01,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:01,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1928042753, now seen corresponding path program 1 times [2019-11-21 12:58:01,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:01,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [151654145] [2019-11-21 12:58:01,091 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-21 12:58:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:01,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:58:01,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:01,267 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-21 12:58:01,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:01,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:01,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:01,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:58:01,281 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-21 12:58:01,281 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:01,320 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-21 12:58:01,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [151654145] [2019-11-21 12:58:01,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:01,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 12:58:01,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533504555] [2019-11-21 12:58:01,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 12:58:01,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:01,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 12:58:01,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:58:01,322 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-21 12:58:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:01,711 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-21 12:58:01,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:58:01,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 12:58:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:01,715 INFO L225 Difference]: With dead ends: 107 [2019-11-21 12:58:01,715 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 12:58:01,716 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-21 12:58:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 12:58:01,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 12:58:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 12:58:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-21 12:58:01,726 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-21 12:58:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:01,726 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-21 12:58:01,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 12:58:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-21 12:58:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 12:58:01,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:01,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:01,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:01,930 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-21 12:58:01,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:01,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863800, now seen corresponding path program 1 times [2019-11-21 12:58:01,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:01,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [761729208] [2019-11-21 12:58:01,932 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-21 12:58:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:02,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 12:58:02,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:02,125 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-21 12:58:02,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:02,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:02,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:02,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:58:02,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-21 12:58:02,134 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:02,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-21 12:58:02,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [761729208] [2019-11-21 12:58:02,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:02,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 12:58:02,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096189108] [2019-11-21 12:58:02,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 12:58:02,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:02,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 12:58:02,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:58:02,149 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-21 12:58:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:02,285 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-21 12:58:02,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:58:02,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-21 12:58:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:02,286 INFO L225 Difference]: With dead ends: 105 [2019-11-21 12:58:02,286 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 12:58:02,287 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-21 12:58:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 12:58:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-21 12:58:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 12:58:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 12:58:02,293 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-21 12:58:02,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:02,294 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 12:58:02,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 12:58:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 12:58:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 12:58:02,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:02,295 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:02,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:02,498 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-21 12:58:02,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:02,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1170863801, now seen corresponding path program 1 times [2019-11-21 12:58:02,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:02,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [854519699] [2019-11-21 12:58:02,500 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-21 12:58:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:02,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:58:02,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:02,711 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-21 12:58:02,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:02,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:02,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:02,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:58:02,724 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-21 12:58:02,724 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:02,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-21 12:58:02,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [854519699] [2019-11-21 12:58:02,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:02,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 12:58:02,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950912622] [2019-11-21 12:58:02,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 12:58:02,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:02,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 12:58:02,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:58:02,761 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-21 12:58:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:03,129 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-21 12:58:03,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 12:58:03,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-21 12:58:03,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:03,132 INFO L225 Difference]: With dead ends: 106 [2019-11-21 12:58:03,132 INFO L226 Difference]: Without dead ends: 106 [2019-11-21 12:58:03,132 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-21 12:58:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-21 12:58:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-21 12:58:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-21 12:58:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-21 12:58:03,138 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-21 12:58:03,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:03,139 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-21 12:58:03,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 12:58:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-21 12:58:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 12:58:03,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:03,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:03,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:03,341 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-21 12:58:03,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021446, now seen corresponding path program 1 times [2019-11-21 12:58:03,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:03,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [124566479] [2019-11-21 12:58:03,343 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-21 12:58:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:03,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:58:03,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:03,538 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-21 12:58:03,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:03,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:03,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:03,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:58:03,560 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-21 12:58:03,561 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:03,622 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-21 12:58:03,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [124566479] [2019-11-21 12:58:03,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:03,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-21 12:58:03,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687118489] [2019-11-21 12:58:03,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:58:03,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:03,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:58:03,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:58:03,624 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-21 12:58:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:04,099 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-21 12:58:04,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:58:04,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 12:58:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:04,101 INFO L225 Difference]: With dead ends: 135 [2019-11-21 12:58:04,101 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 12:58:04,101 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-21 12:58:04,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 12:58:04,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-21 12:58:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 12:58:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-21 12:58:04,108 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-21 12:58:04,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:04,108 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-21 12:58:04,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:58:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-21 12:58:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 12:58:04,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:04,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:58:04,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:04,313 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-21 12:58:04,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:04,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1937021447, now seen corresponding path program 1 times [2019-11-21 12:58:04,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:04,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [807595476] [2019-11-21 12:58:04,315 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-21 12:58:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:04,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:58:04,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:04,534 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-21 12:58:04,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:04,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:04,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:04,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:58:04,560 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-21 12:58:04,560 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:04,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:04,641 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-21 12:58:04,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [807595476] [2019-11-21 12:58:04,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:04,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 12:58:04,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852956158] [2019-11-21 12:58:04,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:58:04,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:04,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:58:04,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:58:04,643 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-21 12:58:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:05,291 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-21 12:58:05,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:58:05,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-21 12:58:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:05,294 INFO L225 Difference]: With dead ends: 109 [2019-11-21 12:58:05,295 INFO L226 Difference]: Without dead ends: 109 [2019-11-21 12:58:05,295 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-21 12:58:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-21 12:58:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-21 12:58:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-21 12:58:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-21 12:58:05,302 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-21 12:58:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:05,302 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-21 12:58:05,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:58:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-21 12:58:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 12:58:05,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:05,304 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-21 12:58:05,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:05,508 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-21 12:58:05,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:05,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774311, now seen corresponding path program 1 times [2019-11-21 12:58:05,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:05,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1709779932] [2019-11-21 12:58:05,509 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-21 12:58:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:05,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 12:58:05,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:05,734 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-21 12:58:05,734 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:05,791 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-21 12:58:05,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1709779932] [2019-11-21 12:58:05,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:05,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 12:58:05,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809721095] [2019-11-21 12:58:05,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:58:05,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:05,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:58:05,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:58:05,794 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 5 states. [2019-11-21 12:58:06,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:06,203 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-21 12:58:06,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:58:06,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-21 12:58:06,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:06,205 INFO L225 Difference]: With dead ends: 135 [2019-11-21 12:58:06,206 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 12:58:06,206 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-21 12:58:06,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 12:58:06,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2019-11-21 12:58:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-21 12:58:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-11-21 12:58:06,211 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 18 [2019-11-21 12:58:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:06,211 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-11-21 12:58:06,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:58:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-11-21 12:58:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 12:58:06,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:06,213 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-21 12:58:06,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:06,418 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-21 12:58:06,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:06,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1756774312, now seen corresponding path program 1 times [2019-11-21 12:58:06,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:06,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1126470026] [2019-11-21 12:58:06,420 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-21 12:58:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:06,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 12:58:06,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:06,701 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-21 12:58:06,702 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:06,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:06,808 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-21 12:58:06,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1126470026] [2019-11-21 12:58:06,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:06,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 3] imperfect sequences [] total 8 [2019-11-21 12:58:06,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243399741] [2019-11-21 12:58:06,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 12:58:06,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:06,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 12:58:06,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-21 12:58:06,810 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 9 states. [2019-11-21 12:58:07,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:07,656 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-21 12:58:07,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 12:58:07,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-21 12:58:07,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:07,658 INFO L225 Difference]: With dead ends: 104 [2019-11-21 12:58:07,658 INFO L226 Difference]: Without dead ends: 104 [2019-11-21 12:58:07,658 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-21 12:58:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-21 12:58:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-21 12:58:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-21 12:58:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-21 12:58:07,664 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-21 12:58:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:07,664 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-21 12:58:07,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 12:58:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-21 12:58:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 12:58:07,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:07,665 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-21 12:58:07,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:07,866 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-21 12:58:07,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:07,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1749282988, now seen corresponding path program 1 times [2019-11-21 12:58:07,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:07,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1711198820] [2019-11-21 12:58:07,869 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-21 12:58:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:08,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 12:58:08,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:08,070 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-21 12:58:08,071 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:08,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-21 12:58:08,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1711198820] [2019-11-21 12:58:08,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:08,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 12:58:08,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419670989] [2019-11-21 12:58:08,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 12:58:08,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:08,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 12:58:08,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:58:08,090 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-21 12:58:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:08,146 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-21 12:58:08,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 12:58:08,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-21 12:58:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:08,154 INFO L225 Difference]: With dead ends: 112 [2019-11-21 12:58:08,154 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 12:58:08,155 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-21 12:58:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 12:58:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-21 12:58:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-21 12:58:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-21 12:58:08,159 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-21 12:58:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:08,160 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-21 12:58:08,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 12:58:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-21 12:58:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 12:58:08,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:08,161 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-21 12:58:08,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:08,364 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-21 12:58:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:08,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800861, now seen corresponding path program 1 times [2019-11-21 12:58:08,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:08,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1426163381] [2019-11-21 12:58:08,367 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-21 12:58:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:08,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:58:08,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:08,583 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-21 12:58:08,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:08,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:08,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:08,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:58:08,604 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-21 12:58:08,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:08,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:08,623 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-21 12:58:08,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-21 12:58:08,651 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-21 12:58:08,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:08,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:08,658 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-21 12:58:08,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-21 12:58:08,678 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-21 12:58:08,679 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:58:08,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1426163381] [2019-11-21 12:58:08,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:08,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 12:58:08,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696890040] [2019-11-21 12:58:08,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:58:08,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:08,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:58:08,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:58:08,701 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 5 states. [2019-11-21 12:58:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:09,023 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-11-21 12:58:09,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:58:09,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-21 12:58:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:09,025 INFO L225 Difference]: With dead ends: 112 [2019-11-21 12:58:09,026 INFO L226 Difference]: Without dead ends: 112 [2019-11-21 12:58:09,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-21 12:58:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-21 12:58:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2019-11-21 12:58:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 12:58:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-21 12:58:09,031 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 19 [2019-11-21 12:58:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:09,031 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-21 12:58:09,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:58:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-21 12:58:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 12:58:09,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:09,033 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-21 12:58:09,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:09,236 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-21 12:58:09,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:09,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1606800860, now seen corresponding path program 1 times [2019-11-21 12:58:09,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:09,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1953430875] [2019-11-21 12:58:09,238 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-21 12:58:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:09,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 12:58:09,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:09,464 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-21 12:58:09,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:09,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:09,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:09,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:58:09,499 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-21 12:58:09,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:09,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:09,524 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-21 12:58:09,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:09,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:09,537 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-21 12:58:09,538 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-21 12:58:09,587 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-21 12:58:09,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:09,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:09,615 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-21 12:58:09,616 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:09,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:09,631 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-21 12:58:09,631 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-21 12:58:09,650 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-21 12:58:09,650 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:09,944 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-21 12:58:09,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1953430875] [2019-11-21 12:58:09,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:09,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 12:58:09,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843807369] [2019-11-21 12:58:09,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:58:09,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:09,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:58:09,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:58:09,946 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 10 states. [2019-11-21 12:58:11,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:11,785 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-21 12:58:11,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 12:58:11,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-21 12:58:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:11,787 INFO L225 Difference]: With dead ends: 116 [2019-11-21 12:58:11,787 INFO L226 Difference]: Without dead ends: 116 [2019-11-21 12:58:11,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-11-21 12:58:11,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-21 12:58:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2019-11-21 12:58:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-21 12:58:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2019-11-21 12:58:11,792 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 19 [2019-11-21 12:58:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:11,793 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2019-11-21 12:58:11,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:58:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2019-11-21 12:58:11,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 12:58:11,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:11,794 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-21 12:58:12,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:12,002 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-21 12:58:12,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:12,002 INFO L82 PathProgramCache]: Analyzing trace with hash -195954174, now seen corresponding path program 1 times [2019-11-21 12:58:12,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:12,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [743757556] [2019-11-21 12:58:12,003 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-21 12:58:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:12,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 12:58:12,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:12,256 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-21 12:58:12,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:12,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:12,267 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-21 12:58:12,268 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:12,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:12,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:12,276 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 12:58:12,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:58:12,342 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-21 12:58:12,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:12,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:12,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:12,362 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-21 12:58:12,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:12,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:12,371 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-21 12:58:12,371 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-11-21 12:58:12,396 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-21 12:58:12,396 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:12,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:12,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:12,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:12,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:12,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:12,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:12,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:12,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:12,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:17,527 WARN L192 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 12:58:17,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:19,952 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-21 12:58:19,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [743757556] [2019-11-21 12:58:19,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:19,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 12:58:19,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862451260] [2019-11-21 12:58:19,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:58:19,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:19,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:58:19,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-21 12:58:19,955 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 10 states. [2019-11-21 12:58:26,137 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-21 12:58:28,246 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-21 12:58:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:51,305 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-11-21 12:58:51,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 12:58:51,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-21 12:58:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:51,307 INFO L225 Difference]: With dead ends: 130 [2019-11-21 12:58:51,307 INFO L226 Difference]: Without dead ends: 130 [2019-11-21 12:58:51,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=40, Invalid=97, Unknown=3, NotChecked=42, Total=182 [2019-11-21 12:58:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-21 12:58:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2019-11-21 12:58:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-21 12:58:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-11-21 12:58:51,313 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 20 [2019-11-21 12:58:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:51,313 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-11-21 12:58:51,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:58:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-11-21 12:58:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 12:58:51,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:51,315 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-21 12:58:51,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:51,516 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-21 12:58:51,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:51,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780014, now seen corresponding path program 1 times [2019-11-21 12:58:51,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:51,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1076151381] [2019-11-21 12:58:51,518 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-21 12:58:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:51,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:58:51,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:51,733 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-21 12:58:51,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:51,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:51,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:51,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 12:58:51,757 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-21 12:58:51,757 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:51,803 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:51,803 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-21 12:58:51,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:51,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:51,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:51,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:51,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-21 12:58:51,814 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-21 12:58:51,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:51,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:51,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:51,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-21 12:58:51,820 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-21 12:58:51,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1076151381] [2019-11-21 12:58:51,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:51,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 12:58:51,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143024729] [2019-11-21 12:58:51,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:58:51,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:51,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:58:51,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:58:51,822 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 5 states. [2019-11-21 12:58:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:52,100 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-21 12:58:52,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:58:52,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-21 12:58:52,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:52,103 INFO L225 Difference]: With dead ends: 113 [2019-11-21 12:58:52,103 INFO L226 Difference]: Without dead ends: 113 [2019-11-21 12:58:52,103 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-21 12:58:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-21 12:58:52,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-11-21 12:58:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-21 12:58:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-11-21 12:58:52,108 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 22 [2019-11-21 12:58:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:52,109 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-11-21 12:58:52,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:58:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-11-21 12:58:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 12:58:52,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:52,110 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-21 12:58:52,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:52,313 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-21 12:58:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:52,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1628780013, now seen corresponding path program 1 times [2019-11-21 12:58:52,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:52,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [404869301] [2019-11-21 12:58:52,314 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-21 12:58:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:52,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:58:52,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:52,568 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-21 12:58:52,568 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:52,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:52,710 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-21 12:58:52,710 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-21 12:58:52,716 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-21 12:58:52,716 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-21 12:58:52,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:52,749 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-21 12:58:52,749 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-21 12:58:52,882 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:52,883 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-21 12:58:52,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:52,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:52,884 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-21 12:58:52,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:52,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:52,921 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-21 12:58:52,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-21 12:58:52,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:53,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:53,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:53,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:53,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:53,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:53,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:53,751 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-21 12:58:53,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [404869301] [2019-11-21 12:58:53,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:58:53,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 12:58:53,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983808683] [2019-11-21 12:58:53,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:58:53,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:58:53,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:58:53,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:58:53,754 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 10 states. [2019-11-21 12:58:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:58:54,418 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-21 12:58:54,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:58:54,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-21 12:58:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:58:54,420 INFO L225 Difference]: With dead ends: 107 [2019-11-21 12:58:54,421 INFO L226 Difference]: Without dead ends: 107 [2019-11-21 12:58:54,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-21 12:58:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-21 12:58:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-21 12:58:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 12:58:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-11-21 12:58:54,425 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 22 [2019-11-21 12:58:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:58:54,426 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-11-21 12:58:54,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:58:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-11-21 12:58:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 12:58:54,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:58:54,427 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-21 12:58:54,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:58:54,630 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-21 12:58:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:58:54,631 INFO L82 PathProgramCache]: Analyzing trace with hash 666602723, now seen corresponding path program 1 times [2019-11-21 12:58:54,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:58:54,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [824864508] [2019-11-21 12:58:54,632 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-21 12:58:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:58:54,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-21 12:58:54,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:58:54,918 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-21 12:58:54,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:54,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:54,931 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-21 12:58:54,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:54,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:54,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:58:54,942 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 12:58:54,990 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:54,991 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-21 12:58:54,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:55,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:55,005 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-21 12:58:55,006 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:55,024 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-21 12:58:55,024 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-21 12:58:55,025 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-21 12:58:55,148 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_old(#length)_AFTER_CALL_46|]} [2019-11-21 12:58:55,168 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:55,168 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-21 12:58:55,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:55,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:55,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:58:55,237 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-21 12:58:55,238 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:58:55,277 INFO L567 ElimStorePlain]: treesize reduction 22, result has 48.8 percent of original size [2019-11-21 12:58:55,277 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-21 12:58:55,277 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:21 [2019-11-21 12:58:55,290 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-21 12:58:55,291 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:58:55,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:55,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:55,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:55,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:55,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:55,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:58:55,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:55,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:58:58,817 WARN L192 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 12:58:58,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:59:01,303 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-21 12:59:01,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:59:01,439 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:01,440 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-21 12:59:01,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:01,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:01,463 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-21 12:59:01,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-21 12:59:01,793 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-21 12:59:01,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [824864508] [2019-11-21 12:59:01,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:59:01,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2019-11-21 12:59:01,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441488616] [2019-11-21 12:59:01,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 12:59:01,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:59:01,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 12:59:01,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=170, Unknown=1, NotChecked=0, Total=210 [2019-11-21 12:59:01,795 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 15 states. [2019-11-21 12:59:55,029 WARN L192 SmtUtils]: Spent 40.90 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-21 13:00:03,181 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_create_data_#t~malloc3.base_11| (_ BitVec 32)) (v_append_~pointerToList.base_BEFORE_CALL_10 (_ BitVec 32)) (v_append_~pointerToList.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_append_~pointerToList.offset_BEFORE_CALL_6 (_ bv4 32)))) (or (not (bvsle v_append_~pointerToList.offset_BEFORE_CALL_6 .cse0)) (not (bvsle (_ bv0 32) v_append_~pointerToList.offset_BEFORE_CALL_6)) (bvsle .cse0 (select (store |c_#length| |v_create_data_#t~malloc3.base_11| (_ bv8 32)) v_append_~pointerToList.base_BEFORE_CALL_10)) (not (= (select |c_#valid| |v_create_data_#t~malloc3.base_11|) (_ bv0 1))) (exists ((v_prenex_12 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_12)) (not (bvsle (bvadd v_append_~pointerToList.offset_BEFORE_CALL_6 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_12 (_ bv8 32)) v_append_~pointerToList.base_BEFORE_CALL_10))))))))) is different from false [2019-11-21 13:00:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:00:31,892 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2019-11-21 13:00:31,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 13:00:31,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-21 13:00:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:00:31,895 INFO L225 Difference]: With dead ends: 127 [2019-11-21 13:00:31,895 INFO L226 Difference]: Without dead ends: 127 [2019-11-21 13:00:31,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 57.7s TimeCoverageRelationStatistics Valid=67, Invalid=237, Unknown=6, NotChecked=32, Total=342 [2019-11-21 13:00:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-21 13:00:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-21 13:00:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-21 13:00:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-11-21 13:00:31,900 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 22 [2019-11-21 13:00:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:00:31,901 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-11-21 13:00:31,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 13:00:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-11-21 13:00:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 13:00:31,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:00:31,902 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-21 13:00:32,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:32,106 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-21 13:00:32,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:00:32,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1889374095, now seen corresponding path program 1 times [2019-11-21 13:00:32,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:00:32,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [636117776] [2019-11-21 13:00:32,108 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-21 13:00:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:00:32,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 13:00:32,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:00:32,354 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-21 13:00:32,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:32,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:32,366 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-21 13:00:32,367 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:32,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:32,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:32,375 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 13:00:32,486 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:32,486 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-21 13:00:32,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:32,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:32,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-21 13:00:32,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:32,528 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-11-21 13:00:32,528 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-21 13:00:32,529 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-21 13:00:32,602 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_199|], 3=[|v_#length_122|]} [2019-11-21 13:00:32,613 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:32,613 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-21 13:00:32,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:32,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:32,659 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:32,659 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 19 treesize of output 46 [2019-11-21 13:00:32,660 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:32,698 INFO L567 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2019-11-21 13:00:32,698 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-21 13:00:32,699 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2019-11-21 13:00:32,736 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-21 13:00:32,737 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:00:32,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:00:33,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:00:33,251 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:33,251 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 24 treesize of output 28 [2019-11-21 13:00:33,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:33,293 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:33,293 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 32 treesize of output 36 [2019-11-21 13:00:33,294 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:33,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:33,312 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 22 treesize of output 26 [2019-11-21 13:00:33,312 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:33,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:33,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-21 13:00:33,365 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:46 [2019-11-21 13:00:33,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:33,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:33,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:00:33,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:00:33,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:33,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:00:33,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:00:33,516 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 13:00:33,523 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-21 13:00:34,676 WARN L192 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-21 13:00:34,680 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 13:00:34,687 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 13:00:34,696 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 13:00:34,700 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 13:00:34,724 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-11-21 13:00:34,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:34,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:34,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:34,879 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2019-11-21 13:00:34,887 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 13:00:34,900 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_2|], 6=[|v_old(#valid)_BEFORE_CALL_2|]} [2019-11-21 13:00:35,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:35,102 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-21 13:00:35,110 INFO L168 Benchmark]: Toolchain (without parser) took 160990.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 259.5 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 70.5 MB. Max. memory is 11.5 GB. [2019-11-21 13:00:35,111 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:00:35,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-21 13:00:35,112 INFO L168 Benchmark]: Boogie Preprocessor took 84.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-21 13:00:35,112 INFO L168 Benchmark]: RCFGBuilder took 952.62 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2019-11-21 13:00:35,112 INFO L168 Benchmark]: TraceAbstraction took 159308.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-11-21 13:00:35,114 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 639.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 952.62 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 159308.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 15.7 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...