./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.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 e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: 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 /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.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 e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:22:17,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:22:17,003 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:22:17,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:22:17,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:22:17,017 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:22:17,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:22:17,020 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:22:17,022 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:22:17,023 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:22:17,024 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:22:17,024 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:22:17,025 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:22:17,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:22:17,028 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:22:17,029 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:22:17,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:22:17,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:22:17,034 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:22:17,036 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:22:17,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:22:17,039 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:22:17,042 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:22:17,042 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:22:17,042 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:22:17,044 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:22:17,045 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:22:17,046 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:22:17,047 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:22:17,048 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:22:17,048 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:22:17,049 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:22:17,049 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:22:17,050 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:22:17,051 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:22:17,052 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:22:17,052 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:22:17,069 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:22:17,069 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:22:17,070 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:22:17,071 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:22:17,071 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:22:17,071 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:22:17,071 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:22:17,072 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:22:17,073 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:22:17,073 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:22:17,073 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:22:17,073 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:22:17,073 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:22:17,073 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:22:17,074 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:22:17,074 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:22:17,075 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:22:17,075 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:22:17,075 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:22:17,075 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:22:17,075 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:22:17,076 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:22:17,076 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:22:17,076 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:22:17,076 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:22:17,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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 -> e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 [2019-01-14 18:22:17,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:22:17,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:22:17,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:22:17,146 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:22:17,146 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:22:17,147 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i [2019-01-14 18:22:17,201 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7270701/147870deb95c416fae65d104ec8bde7f/FLAGcaac71f5c [2019-01-14 18:22:17,712 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:22:17,713 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i [2019-01-14 18:22:17,725 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7270701/147870deb95c416fae65d104ec8bde7f/FLAGcaac71f5c [2019-01-14 18:22:17,982 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7270701/147870deb95c416fae65d104ec8bde7f [2019-01-14 18:22:17,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:22:17,986 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:22:17,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:22:17,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:22:17,992 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:22:17,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:22:17" (1/1) ... [2019-01-14 18:22:17,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f9a908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:17, skipping insertion in model container [2019-01-14 18:22:17,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:22:17" (1/1) ... [2019-01-14 18:22:18,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:22:18,053 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:22:18,397 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:22:18,406 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:22:18,544 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:22:18,615 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:22:18,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:18 WrapperNode [2019-01-14 18:22:18,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:22:18,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:22:18,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:22:18,617 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:22:18,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:18" (1/1) ... [2019-01-14 18:22:18,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:18" (1/1) ... [2019-01-14 18:22:18,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:18" (1/1) ... [2019-01-14 18:22:18,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:18" (1/1) ... [2019-01-14 18:22:18,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:18" (1/1) ... [2019-01-14 18:22:18,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:18" (1/1) ... [2019-01-14 18:22:18,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:18" (1/1) ... [2019-01-14 18:22:18,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:22:18,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:22:18,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:22:18,717 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:22:18,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:18" (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-01-14 18:22:18,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:22:18,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:22:18,776 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-01-14 18:22:18,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:22:18,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 18:22:18,776 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:22:18,776 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:22:18,776 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:22:18,776 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:22:18,777 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:22:18,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:22:18,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:22:18,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:22:18,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:22:18,778 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:22:18,778 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:22:18,778 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:22:18,778 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:22:18,778 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:22:18,778 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:22:18,779 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:22:18,779 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:22:18,779 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:22:18,779 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:22:18,779 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:22:18,779 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:22:18,780 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:22:18,780 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:22:18,780 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:22:18,780 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:22:18,780 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:22:18,780 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:22:18,780 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:22:18,781 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:22:18,781 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:22:18,781 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:22:18,781 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:22:18,781 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:22:18,781 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:22:18,782 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:22:18,782 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:22:18,782 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:22:18,782 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:22:18,782 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:22:18,782 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:22:18,783 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:22:18,783 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:22:18,783 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:22:18,783 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:22:18,783 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:22:18,783 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:22:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:22:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:22:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:22:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:22:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:22:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:22:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:22:18,785 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:22:18,785 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:22:18,785 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:22:18,785 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:22:18,785 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:22:18,785 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:22:18,786 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:22:18,786 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:22:18,786 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:22:18,786 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:22:18,786 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:22:18,786 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 18:22:18,786 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:22:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:22:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:22:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:22:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:22:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:22:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:22:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:22:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:22:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:22:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:22:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:22:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:22:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:22:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:22:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:22:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:22:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:22:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:22:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:22:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:22:18,791 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:22:18,791 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:22:18,791 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:22:18,791 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:22:18,791 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:22:18,792 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:22:18,792 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:22:18,792 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:22:18,792 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:22:18,792 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:22:18,792 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:22:18,792 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:22:18,792 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:22:18,793 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:22:18,793 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:22:18,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:22:18,793 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-01-14 18:22:18,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 18:22:18,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 18:22:18,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 18:22:18,794 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:22:18,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:22:18,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 18:22:18,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:22:18,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:22:18,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:22:19,733 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:22:19,734 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 18:22:19,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:22:19 BoogieIcfgContainer [2019-01-14 18:22:19,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:22:19,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:22:19,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:22:19,739 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:22:19,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:22:17" (1/3) ... [2019-01-14 18:22:19,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3811ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:22:19, skipping insertion in model container [2019-01-14 18:22:19,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:18" (2/3) ... [2019-01-14 18:22:19,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3811ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:22:19, skipping insertion in model container [2019-01-14 18:22:19,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:22:19" (3/3) ... [2019-01-14 18:22:19,743 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2019-01-14 18:22:19,753 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:22:19,761 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-01-14 18:22:19,778 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-01-14 18:22:19,804 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:22:19,805 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:22:19,805 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:22:19,806 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:22:19,806 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:22:19,806 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:22:19,806 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:22:19,806 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:22:19,807 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:22:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-01-14 18:22:19,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 18:22:19,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:19,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:19,841 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:19,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:19,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2122807630, now seen corresponding path program 1 times [2019-01-14 18:22:19,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:19,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:19,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:19,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:19,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:19,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:19,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:22:19,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 18:22:19,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 18:22:19,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 18:22:19,994 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2019-01-14 18:22:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:20,014 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2019-01-14 18:22:20,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 18:22:20,015 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-14 18:22:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:20,025 INFO L225 Difference]: With dead ends: 89 [2019-01-14 18:22:20,025 INFO L226 Difference]: Without dead ends: 86 [2019-01-14 18:22:20,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-01-14 18:22:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-14 18:22:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-14 18:22:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-14 18:22:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2019-01-14 18:22:20,071 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 8 [2019-01-14 18:22:20,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:20,071 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2019-01-14 18:22:20,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 18:22:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2019-01-14 18:22:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:22:20,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:20,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:20,073 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:20,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:20,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1382626283, now seen corresponding path program 1 times [2019-01-14 18:22:20,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:20,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:20,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:20,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:20,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:20,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:20,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:22:20,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:22:20,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:22:20,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:22:20,296 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 5 states. [2019-01-14 18:22:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:21,109 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2019-01-14 18:22:21,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:22:21,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:22:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:21,113 INFO L225 Difference]: With dead ends: 99 [2019-01-14 18:22:21,113 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 18:22:21,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:22:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 18:22:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2019-01-14 18:22:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-14 18:22:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2019-01-14 18:22:21,124 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 9 [2019-01-14 18:22:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:21,125 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2019-01-14 18:22:21,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:22:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2019-01-14 18:22:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:22:21,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:21,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:21,127 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:21,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:21,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1382626284, now seen corresponding path program 1 times [2019-01-14 18:22:21,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:21,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:21,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:21,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:21,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:21,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-01-14 18:22:21,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:21,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:22:21,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:22:21,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:22:21,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:22:21,293 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 5 states. [2019-01-14 18:22:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:21,572 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2019-01-14 18:22:21,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:22:21,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:22:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:21,577 INFO L225 Difference]: With dead ends: 85 [2019-01-14 18:22:21,577 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 18:22:21,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:22:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 18:22:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2019-01-14 18:22:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 18:22:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2019-01-14 18:22:21,587 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 9 [2019-01-14 18:22:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:21,587 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2019-01-14 18:22:21,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:22:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2019-01-14 18:22:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:22:21,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:21,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:21,590 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:21,590 INFO L82 PathProgramCache]: Analyzing trace with hash -88258129, now seen corresponding path program 1 times [2019-01-14 18:22:21,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:21,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:21,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:21,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:21,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:22:21,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:22:21,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:22:21,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:22:21,647 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 3 states. [2019-01-14 18:22:21,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:21,743 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2019-01-14 18:22:21,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:22:21,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:22:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:21,745 INFO L225 Difference]: With dead ends: 77 [2019-01-14 18:22:21,745 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 18:22:21,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 18:22:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 18:22:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-14 18:22:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 18:22:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-01-14 18:22:21,752 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 10 [2019-01-14 18:22:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:21,752 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-01-14 18:22:21,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:22:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-01-14 18:22:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:22:21,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:21,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:21,754 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:21,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:21,754 INFO L82 PathProgramCache]: Analyzing trace with hash -88258128, now seen corresponding path program 1 times [2019-01-14 18:22:21,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:21,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:21,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:21,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:21,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:21,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:22:21,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:22:21,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:22:21,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:22:21,847 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 3 states. [2019-01-14 18:22:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:21,936 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-01-14 18:22:21,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:22:21,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:22:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:21,939 INFO L225 Difference]: With dead ends: 73 [2019-01-14 18:22:21,939 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 18:22:21,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-14 18:22:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 18:22:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-14 18:22:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 18:22:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2019-01-14 18:22:21,947 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 10 [2019-01-14 18:22:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:21,947 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2019-01-14 18:22:21,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:22:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2019-01-14 18:22:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 18:22:21,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:21,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:21,949 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:21,949 INFO L82 PathProgramCache]: Analyzing trace with hash -213829514, now seen corresponding path program 1 times [2019-01-14 18:22:21,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:21,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:21,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:21,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:21,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:22,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:22,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:22:22,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:22:22,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:22:22,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:22:22,230 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 8 states. [2019-01-14 18:22:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:22,570 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2019-01-14 18:22:22,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 18:22:22,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-14 18:22:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:22,573 INFO L225 Difference]: With dead ends: 84 [2019-01-14 18:22:22,573 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 18:22:22,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-01-14 18:22:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 18:22:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2019-01-14 18:22:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 18:22:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2019-01-14 18:22:22,582 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 15 [2019-01-14 18:22:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:22,582 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2019-01-14 18:22:22,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:22:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2019-01-14 18:22:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:22:22,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:22,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:22,584 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1961497780, now seen corresponding path program 1 times [2019-01-14 18:22:22,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:22,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:22,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:22,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:22,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:22,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-01-14 18:22:22,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:22,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:22:22,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:22:22,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:22:22,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:22:22,762 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 7 states. [2019-01-14 18:22:23,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:23,218 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2019-01-14 18:22:23,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:22:23,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-14 18:22:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:23,223 INFO L225 Difference]: With dead ends: 79 [2019-01-14 18:22:23,223 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 18:22:23,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:22:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 18:22:23,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-01-14 18:22:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 18:22:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2019-01-14 18:22:23,238 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 16 [2019-01-14 18:22:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:23,238 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2019-01-14 18:22:23,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:22:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2019-01-14 18:22:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 18:22:23,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:23,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:23,241 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:23,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:23,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1087723232, now seen corresponding path program 1 times [2019-01-14 18:22:23,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:23,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:23,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:23,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:23,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:23,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:23,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:22:23,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:22:23,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:22:23,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:22:23,370 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 7 states. [2019-01-14 18:22:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:23,602 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-01-14 18:22:23,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:22:23,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-01-14 18:22:23,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:23,605 INFO L225 Difference]: With dead ends: 84 [2019-01-14 18:22:23,606 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 18:22:23,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:22:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 18:22:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2019-01-14 18:22:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-14 18:22:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-01-14 18:22:23,611 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 24 [2019-01-14 18:22:23,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:23,613 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-01-14 18:22:23,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:22:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-01-14 18:22:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 18:22:23,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:23,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:23,615 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:23,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:23,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1087723233, now seen corresponding path program 1 times [2019-01-14 18:22:23,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:23,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:23,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:23,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:23,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:23,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:23,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:22:23,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:22:23,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:22:23,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:22:23,791 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 7 states. [2019-01-14 18:22:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:24,070 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-01-14 18:22:24,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:22:24,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-01-14 18:22:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:24,072 INFO L225 Difference]: With dead ends: 85 [2019-01-14 18:22:24,073 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 18:22:24,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:22:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 18:22:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2019-01-14 18:22:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 18:22:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-01-14 18:22:24,077 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 24 [2019-01-14 18:22:24,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:24,078 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-01-14 18:22:24,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:22:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-01-14 18:22:24,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 18:22:24,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:24,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:24,079 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:24,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:24,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1645139224, now seen corresponding path program 1 times [2019-01-14 18:22:24,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:24,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:24,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:24,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:24,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:24,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:24,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:22:24,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:22:24,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:22:24,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:22:24,197 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 6 states. [2019-01-14 18:22:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:24,375 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-01-14 18:22:24,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:22:24,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-14 18:22:24,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:24,377 INFO L225 Difference]: With dead ends: 68 [2019-01-14 18:22:24,378 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 18:22:24,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:22:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 18:22:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-14 18:22:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 18:22:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-01-14 18:22:24,383 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-01-14 18:22:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:24,383 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-01-14 18:22:24,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:22:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-01-14 18:22:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 18:22:24,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:24,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:24,385 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:24,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:24,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1165444767, now seen corresponding path program 1 times [2019-01-14 18:22:24,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:24,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:24,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:24,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:24,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:24,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:24,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:22:24,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:22:24,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:22:24,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:22:24,489 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 6 states. [2019-01-14 18:22:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:24,701 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-14 18:22:24,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:22:24,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-01-14 18:22:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:24,704 INFO L225 Difference]: With dead ends: 67 [2019-01-14 18:22:24,705 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 18:22:24,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:22:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 18:22:24,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-14 18:22:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 18:22:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-01-14 18:22:24,708 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 27 [2019-01-14 18:22:24,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:24,709 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-01-14 18:22:24,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:22:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-01-14 18:22:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 18:22:24,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:24,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:24,710 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:24,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:24,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1769049343, now seen corresponding path program 1 times [2019-01-14 18:22:24,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:24,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:24,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:24,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:24,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:25,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:25,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:22:25,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:22:25,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:22:25,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:22:25,020 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 6 states. [2019-01-14 18:22:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:25,182 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-01-14 18:22:25,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:22:25,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-14 18:22:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:25,185 INFO L225 Difference]: With dead ends: 66 [2019-01-14 18:22:25,185 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 18:22:25,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:22:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 18:22:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-14 18:22:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-14 18:22:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-01-14 18:22:25,189 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 28 [2019-01-14 18:22:25,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:25,189 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-01-14 18:22:25,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:22:25,189 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-01-14 18:22:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 18:22:25,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:25,190 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:25,191 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:25,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:25,191 INFO L82 PathProgramCache]: Analyzing trace with hash -538427448, now seen corresponding path program 1 times [2019-01-14 18:22:25,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:25,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:25,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:25,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:25,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:25,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:22:25,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:22:25,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:25,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:25,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:22:25,651 INFO L478 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 8 treesize of output 7 [2019-01-14 18:22:25,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:25,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:25,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:25,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-14 18:22:25,883 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2019-01-14 18:22:25,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:25,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:25,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-01-14 18:22:26,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2019-01-14 18:22:26,050 INFO L478 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 26 treesize of output 25 [2019-01-14 18:22:26,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:26,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:26,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:26,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-01-14 18:22:26,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2019-01-14 18:22:26,192 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2019-01-14 18:22:26,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:26,232 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2019-01-14 18:22:26,233 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:26,261 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2019-01-14 18:22:26,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:26,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:26,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:26,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2019-01-14 18:22:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:26,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:22:26,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2019-01-14 18:22:26,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 18:22:26,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 18:22:26,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-01-14 18:22:26,317 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 16 states. [2019-01-14 18:22:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:27,229 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-01-14 18:22:27,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 18:22:27,230 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-01-14 18:22:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:27,236 INFO L225 Difference]: With dead ends: 72 [2019-01-14 18:22:27,236 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 18:22:27,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2019-01-14 18:22:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 18:22:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-01-14 18:22:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-14 18:22:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-14 18:22:27,240 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 29 [2019-01-14 18:22:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:27,240 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-14 18:22:27,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 18:22:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-14 18:22:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 18:22:27,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:27,242 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:27,242 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:27,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:27,242 INFO L82 PathProgramCache]: Analyzing trace with hash -538427447, now seen corresponding path program 1 times [2019-01-14 18:22:27,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:27,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:27,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:27,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:27,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:22:27,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:22:27,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:27,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:27,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:22:27,806 INFO L478 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 8 treesize of output 7 [2019-01-14 18:22:27,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:27,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:27,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:22:27,825 INFO L478 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 8 treesize of output 7 [2019-01-14 18:22:27,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:27,838 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:27,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:27,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2019-01-14 18:22:28,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:28,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:28,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-14 18:22:28,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,019 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-14 18:22:28,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2019-01-14 18:22:28,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 23 treesize of output 33 [2019-01-14 18:22:28,243 INFO L478 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 24 treesize of output 23 [2019-01-14 18:22:28,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 33 treesize of output 41 [2019-01-14 18:22:28,325 INFO L478 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 27 treesize of output 27 [2019-01-14 18:22:28,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-14 18:22:28,359 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:28,388 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2019-01-14 18:22:28,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2019-01-14 18:22:28,452 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-01-14 18:22:28,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,476 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2019-01-14 18:22:28,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,498 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-01-14 18:22:28,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-01-14 18:22:28,538 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2019-01-14 18:22:28,538 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,547 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:28,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:28,557 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2019-01-14 18:22:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:28,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:22:28,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2019-01-14 18:22:28,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-14 18:22:28,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-14 18:22:28,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-01-14 18:22:28,645 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 19 states. [2019-01-14 18:22:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:30,505 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-01-14 18:22:30,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 18:22:30,508 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-01-14 18:22:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:30,510 INFO L225 Difference]: With dead ends: 71 [2019-01-14 18:22:30,510 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 18:22:30,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2019-01-14 18:22:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 18:22:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-01-14 18:22:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 18:22:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-01-14 18:22:30,514 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 29 [2019-01-14 18:22:30,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:30,515 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-01-14 18:22:30,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-14 18:22:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-01-14 18:22:30,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 18:22:30,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:30,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:30,516 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:30,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:30,516 INFO L82 PathProgramCache]: Analyzing trace with hash 994045283, now seen corresponding path program 1 times [2019-01-14 18:22:30,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:30,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:30,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:30,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:30,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:31,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:31,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:22:31,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:22:31,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:22:31,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:22:31,111 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 7 states. [2019-01-14 18:22:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:31,400 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-01-14 18:22:31,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:22:31,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-01-14 18:22:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:31,403 INFO L225 Difference]: With dead ends: 68 [2019-01-14 18:22:31,403 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 18:22:31,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:22:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 18:22:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-14 18:22:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 18:22:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-01-14 18:22:31,409 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2019-01-14 18:22:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:31,410 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-01-14 18:22:31,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:22:31,410 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-01-14 18:22:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:22:31,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:31,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:31,415 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:31,415 INFO L82 PathProgramCache]: Analyzing trace with hash 750632772, now seen corresponding path program 1 times [2019-01-14 18:22:31,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:31,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:31,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:31,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:31,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:32,053 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-14 18:22:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:32,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:32,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:22:32,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:22:32,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:22:32,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:22:32,222 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 8 states. [2019-01-14 18:22:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:32,455 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-01-14 18:22:32,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:22:32,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-01-14 18:22:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:32,458 INFO L225 Difference]: With dead ends: 64 [2019-01-14 18:22:32,459 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 18:22:32,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-14 18:22:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 18:22:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-14 18:22:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 18:22:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-01-14 18:22:32,462 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 30 [2019-01-14 18:22:32,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:32,462 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-01-14 18:22:32,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:22:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-01-14 18:22:32,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 18:22:32,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:32,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:32,464 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr11REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2019-01-14 18:22:32,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:32,464 INFO L82 PathProgramCache]: Analyzing trace with hash 227346506, now seen corresponding path program 1 times [2019-01-14 18:22:32,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:22:32,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:22:32,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:32,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:32,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:22:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:22:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:22:32,547 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 18:22:32,566 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-14 18:22:32,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:22:32 BoogieIcfgContainer [2019-01-14 18:22:32,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:22:32,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:22:32,585 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:22:32,586 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:22:32,587 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:22:19" (3/4) ... [2019-01-14 18:22:32,592 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 18:22:32,592 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:22:32,593 INFO L168 Benchmark]: Toolchain (without parser) took 14606.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -123.2 MB). Peak memory consumption was 170.4 MB. Max. memory is 11.5 GB. [2019-01-14 18:22:32,594 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:22:32,595 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-01-14 18:22:32,596 INFO L168 Benchmark]: Boogie Preprocessor took 99.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:22:32,597 INFO L168 Benchmark]: RCFGBuilder took 1018.92 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: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2019-01-14 18:22:32,598 INFO L168 Benchmark]: TraceAbstraction took 12847.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.4 MB). Peak memory consumption was 150.8 MB. Max. memory is 11.5 GB. [2019-01-14 18:22:32,599 INFO L168 Benchmark]: Witness Printer took 7.32 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:22:32,604 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 628.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1018.92 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: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12847.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.4 MB). Peak memory consumption was 150.8 MB. Max. memory is 11.5 GB. * Witness Printer took 7.32 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] struct item *list = ((void *)0); VAL [list={-1:0}] [L637] CALL append(&list) VAL [plist={-1:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L628] EXPR item->next VAL [item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={2:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={2:0}, plist={-1:0}, plist={-1:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={2:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={2:0}, plist={-1:0}, plist={-1:0}] [L631] *plist = item VAL [item={1:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={2:0}, plist={-1:0}, plist={-1:0}] [L637] RET append(&list) VAL [list={-1:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={1:0}, list={-1:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={1:0}, list={-1:0}] [L640] EXPR list->next VAL [\read(*list)={1:0}, list={-1:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={1:0}, list={-1:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={1:0}, list={-1:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={1:0}, list={-1:0}, next={0:0}] [L641] free(list) [L642] list = next VAL [list={-1:0}, next={0:0}] [L644] \read(*list) VAL [\read(*list)={0:0}, list={-1:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; [L635] struct item *list = ((void *)0); [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 41 error locations. UNSAFE Result, 12.7s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 778 SDtfs, 738 SDslu, 2188 SDs, 0 SdLazy, 2275 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 47 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 363 ConstructedInterpolants, 11 QuantifiedInterpolants, 78210 SizeOfPredicates, 35 NumberOfNonLiveVariables, 374 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:22:34,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:22:34,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:22:34,903 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:22:34,904 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:22:34,905 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:22:34,906 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:22:34,908 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:22:34,910 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:22:34,911 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:22:34,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:22:34,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:22:34,913 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:22:34,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:22:34,916 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:22:34,916 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:22:34,917 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:22:34,919 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:22:34,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:22:34,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:22:34,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:22:34,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:22:34,928 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:22:34,928 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:22:34,928 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:22:34,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:22:34,930 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:22:34,931 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:22:34,932 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:22:34,933 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:22:34,933 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:22:34,934 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:22:34,935 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:22:34,935 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:22:34,936 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:22:34,936 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:22:34,937 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-14 18:22:34,951 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:22:34,952 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:22:34,953 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:22:34,953 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:22:34,953 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:22:34,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:22:34,954 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:22:34,954 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:22:34,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:22:34,955 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:22:34,955 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:22:34,955 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:22:34,955 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:22:34,956 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:22:34,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:22:34,956 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-14 18:22:34,956 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-14 18:22:34,956 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:22:34,956 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:22:34,957 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:22:34,958 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:22:34,958 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:22:34,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:22:34,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:22:34,959 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:22:34,960 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-14 18:22:34,960 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:22:34,960 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-14 18:22:34,960 INFO L133 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 -> e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 [2019-01-14 18:22:34,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:22:35,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:22:35,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:22:35,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:22:35,013 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:22:35,014 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i [2019-01-14 18:22:35,081 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bab214d5/a3d164c3930443d6ad4e84b8136df432/FLAGdffc9cfc5 [2019-01-14 18:22:35,585 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:22:35,586 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-0232_false-valid-memtrack.i [2019-01-14 18:22:35,598 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bab214d5/a3d164c3930443d6ad4e84b8136df432/FLAGdffc9cfc5 [2019-01-14 18:22:35,884 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bab214d5/a3d164c3930443d6ad4e84b8136df432 [2019-01-14 18:22:35,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:22:35,890 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:22:35,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:22:35,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:22:35,895 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:22:35,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:22:35" (1/1) ... [2019-01-14 18:22:35,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2907c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:35, skipping insertion in model container [2019-01-14 18:22:35,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:22:35" (1/1) ... [2019-01-14 18:22:35,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:22:35,959 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:22:36,329 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:22:36,341 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:22:36,461 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:22:36,527 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:22:36,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:36 WrapperNode [2019-01-14 18:22:36,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:22:36,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:22:36,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:22:36,529 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:22:36,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:36" (1/1) ... [2019-01-14 18:22:36,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:36" (1/1) ... [2019-01-14 18:22:36,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:36" (1/1) ... [2019-01-14 18:22:36,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:36" (1/1) ... [2019-01-14 18:22:36,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:36" (1/1) ... [2019-01-14 18:22:36,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:36" (1/1) ... [2019-01-14 18:22:36,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:36" (1/1) ... [2019-01-14 18:22:36,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:22:36,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:22:36,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:22:36,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:22:36,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:36" (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-01-14 18:22:36,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:22:36,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:22:36,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-14 18:22:36,657 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-01-14 18:22:36,657 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:22:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 18:22:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:22:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:22:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:22:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:22:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:22:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:22:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:22:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:22:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:22:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:22:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:22:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:22:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:22:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:22:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:22:36,664 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:22:36,664 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:22:36,664 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:22:36,664 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:22:36,664 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:22:36,664 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:22:36,664 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:22:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:22:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:22:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:22:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:22:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:22:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:22:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:22:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:22:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:22:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:22:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:22:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:22:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:22:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:22:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:22:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:22:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:22:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:22:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:22:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:22:36,673 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:22:36,673 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:22:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:22:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:22:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:22:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:22:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:22:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:22:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:22:36,674 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:22:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:22:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:22:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:22:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:22:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:22:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:22:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:22:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:22:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:22:36,677 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:22:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:22:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:22:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 18:22:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:22:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:22:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:22:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:22:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:22:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:22:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:22:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:22:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:22:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:22:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:22:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:22:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:22:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:22:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:22:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:22:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:22:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:22:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:22:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:22:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:22:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:22:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:22:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:22:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:22:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:22:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:22:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:22:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:22:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:22:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:22:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:22:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:22:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:22:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:22:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:22:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:22:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-01-14 18:22:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 18:22:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 18:22:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 18:22:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:22:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:22:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 18:22:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:22:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:22:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:22:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-14 18:22:37,592 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:22:37,593 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 18:22:37,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:22:37 BoogieIcfgContainer [2019-01-14 18:22:37,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:22:37,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:22:37,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:22:37,599 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:22:37,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:22:35" (1/3) ... [2019-01-14 18:22:37,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c16369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:22:37, skipping insertion in model container [2019-01-14 18:22:37,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:22:36" (2/3) ... [2019-01-14 18:22:37,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c16369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:22:37, skipping insertion in model container [2019-01-14 18:22:37,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:22:37" (3/3) ... [2019-01-14 18:22:37,603 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2019-01-14 18:22:37,610 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:22:37,619 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-01-14 18:22:37,635 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-01-14 18:22:37,662 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:22:37,663 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:22:37,664 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:22:37,664 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:22:37,664 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:22:37,665 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:22:37,665 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:22:37,665 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:22:37,665 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:22:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-01-14 18:22:37,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 18:22:37,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:37,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:37,699 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:37,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1818457071, now seen corresponding path program 1 times [2019-01-14 18:22:37,710 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:37,710 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:37,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:37,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:37,794 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:37,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:37,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:22:37,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 18:22:37,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 18:22:37,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 18:22:37,816 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2019-01-14 18:22:37,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:37,839 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-14 18:22:37,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 18:22:37,841 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-14 18:22:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:37,852 INFO L225 Difference]: With dead ends: 88 [2019-01-14 18:22:37,852 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 18:22:37,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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-01-14 18:22:37,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 18:22:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-14 18:22:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-14 18:22:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2019-01-14 18:22:37,899 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 8 [2019-01-14 18:22:37,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:37,899 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2019-01-14 18:22:37,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 18:22:37,900 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2019-01-14 18:22:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:22:37,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:37,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:37,902 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:37,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:37,902 INFO L82 PathProgramCache]: Analyzing trace with hash 537693552, now seen corresponding path program 1 times [2019-01-14 18:22:37,903 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:37,903 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:37,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:37,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:38,042 INFO L478 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-01-14 18:22:38,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:38,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:38,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 18:22:38,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:38,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:38,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2019-01-14 18:22:38,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:38,266 INFO L267 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-01-14 18:22:38,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-01-14 18:22:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:38,338 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:38,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:38,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:22:38,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:22:38,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:22:38,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:22:38,344 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 5 states. [2019-01-14 18:22:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:39,375 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2019-01-14 18:22:39,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:22:39,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:22:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:39,385 INFO L225 Difference]: With dead ends: 77 [2019-01-14 18:22:39,385 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 18:22:39,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:22:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 18:22:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-14 18:22:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 18:22:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-01-14 18:22:39,407 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 9 [2019-01-14 18:22:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:39,407 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-01-14 18:22:39,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:22:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-01-14 18:22:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:22:39,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:39,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:39,411 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:39,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:39,411 INFO L82 PathProgramCache]: Analyzing trace with hash 537693553, now seen corresponding path program 1 times [2019-01-14 18:22:39,411 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:39,412 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:39,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:39,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:39,503 INFO L478 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-01-14 18:22:39,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:39,531 INFO L478 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-01-14 18:22:39,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:39,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:39,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-14 18:22:39,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:39,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:39,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-14 18:22:39,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:39,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:39,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:39,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-14 18:22:39,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:39,695 INFO L267 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-01-14 18:22:39,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-01-14 18:22:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:39,720 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:39,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:39,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:22:39,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:22:39,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:22:39,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:22:39,725 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 5 states. [2019-01-14 18:22:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:40,356 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-01-14 18:22:40,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:22:40,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 18:22:40,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:40,362 INFO L225 Difference]: With dead ends: 95 [2019-01-14 18:22:40,362 INFO L226 Difference]: Without dead ends: 95 [2019-01-14 18:22:40,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-01-14 18:22:40,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-14 18:22:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2019-01-14 18:22:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-14 18:22:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2019-01-14 18:22:40,373 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 9 [2019-01-14 18:22:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:40,373 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2019-01-14 18:22:40,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:22:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2019-01-14 18:22:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:22:40,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:40,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:40,375 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:40,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:40,376 INFO L82 PathProgramCache]: Analyzing trace with hash -511369007, now seen corresponding path program 1 times [2019-01-14 18:22:40,376 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:40,376 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:40,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:40,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:40,447 INFO L478 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-01-14 18:22:40,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:40,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:40,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 18:22:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:40,473 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:40,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:40,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:22:40,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:22:40,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:22:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:22:40,479 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 3 states. [2019-01-14 18:22:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:40,668 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2019-01-14 18:22:40,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:22:40,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:22:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:40,670 INFO L225 Difference]: With dead ends: 78 [2019-01-14 18:22:40,670 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 18:22:40,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-01-14 18:22:40,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 18:22:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-14 18:22:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 18:22:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2019-01-14 18:22:40,677 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 10 [2019-01-14 18:22:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:40,678 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2019-01-14 18:22:40,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:22:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2019-01-14 18:22:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:22:40,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:40,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:40,680 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:40,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash -511369008, now seen corresponding path program 1 times [2019-01-14 18:22:40,680 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:40,680 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:40,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:40,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:40,745 INFO L478 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-01-14 18:22:40,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:40,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:40,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 18:22:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:40,774 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2019-01-14 18:22:40,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:40,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:22:40,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:22:40,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:22:40,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:22:40,777 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 3 states. [2019-01-14 18:22:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:40,885 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2019-01-14 18:22:40,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:22:40,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:22:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:40,886 INFO L225 Difference]: With dead ends: 74 [2019-01-14 18:22:40,887 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 18:22:40,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:22:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 18:22:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-14 18:22:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 18:22:40,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-01-14 18:22:40,894 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 10 [2019-01-14 18:22:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:40,895 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-01-14 18:22:40,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:22:40,895 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-01-14 18:22:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 18:22:40,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:40,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:40,897 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:40,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1265568891, now seen corresponding path program 1 times [2019-01-14 18:22:40,899 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:40,899 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:40,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:40,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:41,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2019-01-14 18:22:41,164 INFO L478 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 24 treesize of output 23 [2019-01-14 18:22:41,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2019-01-14 18:22:41,358 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-01-14 18:22:41,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,418 INFO L478 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 20 treesize of output 19 [2019-01-14 18:22:41,418 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:41,458 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2019-01-14 18:22:41,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-01-14 18:22:41,663 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2019-01-14 18:22:41,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,694 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-14 18:22:41,694 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,721 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2019-01-14 18:22:41,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-01-14 18:22:41,768 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2019-01-14 18:22:41,769 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,801 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-14 18:22:41,802 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,827 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2019-01-14 18:22:41,827 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,834 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:41,841 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2019-01-14 18:22:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:41,863 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:41,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:41,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:22:41,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:22:41,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:22:41,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=39, Unknown=4, NotChecked=0, Total=56 [2019-01-14 18:22:41,866 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 8 states. [2019-01-14 18:22:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:42,670 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-01-14 18:22:42,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:22:42,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-14 18:22:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:42,673 INFO L225 Difference]: With dead ends: 82 [2019-01-14 18:22:42,673 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 18:22:42,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=96, Unknown=14, NotChecked=0, Total=156 [2019-01-14 18:22:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 18:22:42,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-01-14 18:22:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 18:22:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2019-01-14 18:22:42,683 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 15 [2019-01-14 18:22:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:42,684 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2019-01-14 18:22:42,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:22:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2019-01-14 18:22:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 18:22:42,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:42,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:42,686 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:42,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:42,686 INFO L82 PathProgramCache]: Analyzing trace with hash 578208085, now seen corresponding path program 1 times [2019-01-14 18:22:42,687 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:42,687 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:42,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:42,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:42,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:42,923 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-14 18:22:42,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:42,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:42,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:42,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 18:22:42,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:42,979 INFO L267 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-01-14 18:22:42,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-01-14 18:22:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:43,011 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:43,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:43,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:22:43,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:22:43,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:22:43,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:22:43,015 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 7 states. [2019-01-14 18:22:43,246 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 18:22:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:45,655 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-01-14 18:22:45,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:22:45,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-14 18:22:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:45,658 INFO L225 Difference]: With dead ends: 82 [2019-01-14 18:22:45,658 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 18:22:45,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:22:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 18:22:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-14 18:22:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-14 18:22:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2019-01-14 18:22:45,667 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 16 [2019-01-14 18:22:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:45,668 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2019-01-14 18:22:45,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:22:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2019-01-14 18:22:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 18:22:45,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:45,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:45,671 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:45,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:45,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1857015227, now seen corresponding path program 1 times [2019-01-14 18:22:45,672 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:45,672 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:45,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:45,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:45,827 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:22:45,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:45,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:45,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-14 18:22:45,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:22:45,878 INFO L478 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 8 treesize of output 7 [2019-01-14 18:22:45,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:45,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:45,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:45,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-14 18:22:45,936 INFO L478 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 15 [2019-01-14 18:22:45,953 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-01-14 18:22:45,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:45,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:45,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:45,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-01-14 18:22:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:45,982 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:45,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:45,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:22:45,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:22:45,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:22:45,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:22:45,987 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 8 states. [2019-01-14 18:22:46,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:46,871 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-01-14 18:22:46,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:22:46,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-01-14 18:22:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:46,874 INFO L225 Difference]: With dead ends: 90 [2019-01-14 18:22:46,874 INFO L226 Difference]: Without dead ends: 90 [2019-01-14 18:22:46,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:22:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-14 18:22:46,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2019-01-14 18:22:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 18:22:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2019-01-14 18:22:46,880 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 23 [2019-01-14 18:22:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:46,881 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2019-01-14 18:22:46,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:22:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2019-01-14 18:22:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 18:22:46,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:46,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:46,882 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:46,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:46,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1857015226, now seen corresponding path program 1 times [2019-01-14 18:22:46,884 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:46,884 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:46,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:46,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:47,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:22:47,069 INFO L478 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 8 treesize of output 7 [2019-01-14 18:22:47,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:47,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:47,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:22:47,099 INFO L478 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 8 treesize of output 7 [2019-01-14 18:22:47,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:47,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:47,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:47,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-01-14 18:22:47,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 18:22:47,171 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 18:22:47,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:47,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:47,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-14 18:22:47,193 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-14 18:22:47,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:47,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:47,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:47,207 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-01-14 18:22:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:47,229 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:47,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:47,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:22:47,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:22:47,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:22:47,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:22:47,232 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 8 states. [2019-01-14 18:22:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:47,831 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2019-01-14 18:22:47,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:22:47,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-01-14 18:22:47,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:47,834 INFO L225 Difference]: With dead ends: 92 [2019-01-14 18:22:47,834 INFO L226 Difference]: Without dead ends: 92 [2019-01-14 18:22:47,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:22:47,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-14 18:22:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2019-01-14 18:22:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 18:22:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2019-01-14 18:22:47,840 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 23 [2019-01-14 18:22:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:47,841 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2019-01-14 18:22:47,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:22:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2019-01-14 18:22:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 18:22:47,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:47,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:47,843 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:47,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2134928381, now seen corresponding path program 1 times [2019-01-14 18:22:47,844 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:47,844 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:47,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:47,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:47,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:22:47,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 18:22:47,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:47,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:48,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:48,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-01-14 18:22:48,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-01-14 18:22:48,041 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2019-01-14 18:22:48,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:48,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:48,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:48,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-01-14 18:22:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:48,055 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:48,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:48,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:22:48,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:22:48,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:22:48,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:22:48,058 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 7 states. [2019-01-14 18:22:48,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:48,422 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-01-14 18:22:48,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:22:48,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-14 18:22:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:48,424 INFO L225 Difference]: With dead ends: 74 [2019-01-14 18:22:48,425 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 18:22:48,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:22:48,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 18:22:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-14 18:22:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 18:22:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-01-14 18:22:48,430 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 25 [2019-01-14 18:22:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:48,430 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-01-14 18:22:48,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:22:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-01-14 18:22:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 18:22:48,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:48,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:48,432 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:48,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:48,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1133117218, now seen corresponding path program 1 times [2019-01-14 18:22:48,433 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:48,433 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:48,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:48,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:48,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:22:48,700 INFO L478 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 8 treesize of output 7 [2019-01-14 18:22:48,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:48,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:48,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:48,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-14 18:22:48,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 18:22:48,761 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 18:22:48,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:48,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:48,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:48,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 18:22:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:48,778 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:48,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:48,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:22:48,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:22:48,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:22:48,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:22:48,781 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 7 states. [2019-01-14 18:22:49,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:49,101 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-14 18:22:49,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:22:49,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-01-14 18:22:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:49,103 INFO L225 Difference]: With dead ends: 73 [2019-01-14 18:22:49,104 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 18:22:49,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:22:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 18:22:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-14 18:22:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 18:22:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-01-14 18:22:49,109 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 26 [2019-01-14 18:22:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:49,109 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-01-14 18:22:49,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:22:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-01-14 18:22:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 18:22:49,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:49,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:49,111 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:49,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:49,111 INFO L82 PathProgramCache]: Analyzing trace with hash 766895462, now seen corresponding path program 1 times [2019-01-14 18:22:49,113 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:49,113 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:49,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:49,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:49,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:22:49,295 INFO L478 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 8 treesize of output 7 [2019-01-14 18:22:49,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:49,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:49,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:49,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-14 18:22:49,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 18:22:49,344 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 18:22:49,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:49,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:49,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:49,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 18:22:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:49,368 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:22:49,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:22:49,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:22:49,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:22:49,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:22:49,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:22:49,371 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 7 states. [2019-01-14 18:22:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:49,779 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-01-14 18:22:49,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:22:49,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-01-14 18:22:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:49,781 INFO L225 Difference]: With dead ends: 72 [2019-01-14 18:22:49,782 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 18:22:49,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:22:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 18:22:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-14 18:22:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 18:22:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-01-14 18:22:49,787 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 27 [2019-01-14 18:22:49,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:49,787 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-01-14 18:22:49,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:22:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-01-14 18:22:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 18:22:49,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:49,790 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:49,790 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:49,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:49,790 INFO L82 PathProgramCache]: Analyzing trace with hash 766450185, now seen corresponding path program 1 times [2019-01-14 18:22:49,792 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:49,792 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:49,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:49,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:49,973 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:22:49,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:49,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:49,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-14 18:22:50,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:22:50,021 INFO L478 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 8 treesize of output 7 [2019-01-14 18:22:50,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:50,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:50,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:50,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-14 18:22:50,104 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 18:22:50,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:50,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:50,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2019-01-14 18:22:50,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2019-01-14 18:22:50,212 INFO L478 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 28 treesize of output 27 [2019-01-14 18:22:50,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:50,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:50,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:50,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2019-01-14 18:22:50,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2019-01-14 18:22:50,381 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2019-01-14 18:22:50,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:50,442 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2019-01-14 18:22:50,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:50,468 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-01-14 18:22:50,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:50,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:50,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:50,483 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2019-01-14 18:22:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:50,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 18:22:50,873 INFO L478 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 11 treesize of output 9 [2019-01-14 18:22:50,879 INFO L478 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 9 treesize of output 7 [2019-01-14 18:22:50,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:50,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:50,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 18:22:50,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2019-01-14 18:22:51,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2019-01-14 18:22:51,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:51,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2019-01-14 18:22:51,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:51,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:22:51,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2019-01-14 18:22:51,102 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2019-01-14 18:22:51,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:51,104 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2019-01-14 18:22:51,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:51,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:22:51,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-01-14 18:22:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:51,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:22:51,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-01-14 18:22:51,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:22:51,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:22:51,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:22:51,149 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 17 states. [2019-01-14 18:22:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:22:53,011 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-01-14 18:22:53,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 18:22:53,013 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-01-14 18:22:53,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:22:53,014 INFO L225 Difference]: With dead ends: 76 [2019-01-14 18:22:53,014 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 18:22:53,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-01-14 18:22:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 18:22:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2019-01-14 18:22:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 18:22:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-01-14 18:22:53,022 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 28 [2019-01-14 18:22:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:22:53,023 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-01-14 18:22:53,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:22:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-01-14 18:22:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 18:22:53,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:22:53,026 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:22:53,028 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:22:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:22:53,028 INFO L82 PathProgramCache]: Analyzing trace with hash 766450186, now seen corresponding path program 1 times [2019-01-14 18:22:53,028 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:22:53,029 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:22:53,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:22:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:22:53,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:22:53,211 INFO L478 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-01-14 18:22:53,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:53,239 INFO L478 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-01-14 18:22:53,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:53,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:53,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2019-01-14 18:22:53,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:53,324 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 18:22:53,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:53,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:53,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:53,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 18:22:53,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:53,766 INFO L267 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-01-14 18:22:53,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-01-14 18:22:53,973 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 18:22:54,214 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 18:22:54,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:22:54,268 INFO L478 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 8 treesize of output 7 [2019-01-14 18:22:54,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:54,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:54,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:22:54,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 18:22:54,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:54,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:54,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:54,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:43 [2019-01-14 18:22:54,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:54,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2019-01-14 18:22:54,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:54,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:54,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:22:54,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2019-01-14 18:22:54,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:54,652 INFO L267 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-01-14 18:22:54,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:46 [2019-01-14 18:22:54,888 INFO L303 Elim1Store]: Index analysis took 131 ms [2019-01-14 18:22:55,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2019-01-14 18:22:55,033 INFO L478 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 24 treesize of output 23 [2019-01-14 18:22:55,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:55,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:55,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2019-01-14 18:22:55,200 INFO L478 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 29 treesize of output 29 [2019-01-14 18:22:55,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:55,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-14 18:22:55,275 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:55,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:55,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:55,348 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2019-01-14 18:22:55,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-01-14 18:22:55,427 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2019-01-14 18:22:55,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:55,468 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2019-01-14 18:22:55,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:55,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:55,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2019-01-14 18:22:55,531 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-14 18:22:55,531 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:55,574 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2019-01-14 18:22:55,575 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:55,609 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-01-14 18:22:55,611 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:55,626 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:55,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:55,638 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:18 [2019-01-14 18:22:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:22:55,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 18:22:57,267 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-01-14 18:22:57,274 INFO L478 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 25 treesize of output 21 [2019-01-14 18:22:57,277 INFO L478 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 11 treesize of output 7 [2019-01-14 18:22:57,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:57,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:57,295 INFO L478 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 29 treesize of output 25 [2019-01-14 18:22:57,302 INFO L478 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 11 treesize of output 7 [2019-01-14 18:22:57,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:57,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:57,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-01-14 18:22:57,322 INFO L478 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 11 treesize of output 7 [2019-01-14 18:22:57,323 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:57,328 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:57,569 INFO L478 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 17 [2019-01-14 18:22:57,573 INFO L478 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 7 treesize of output 5 [2019-01-14 18:22:57,575 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:57,580 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:57,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-01-14 18:22:57,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-14 18:22:57,590 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:57,596 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:22:57,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2019-01-14 18:22:57,784 INFO L478 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 16 treesize of output 14 [2019-01-14 18:22:57,785 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:57,804 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:57,808 INFO L478 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 28 treesize of output 26 [2019-01-14 18:22:57,813 INFO L478 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 16 treesize of output 14 [2019-01-14 18:22:57,813 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:57,833 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:58,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2019-01-14 18:22:58,043 INFO L478 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-01-14 18:22:58,044 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:58,067 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:58,073 INFO L478 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 24 treesize of output 22 [2019-01-14 18:22:58,079 INFO L478 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 12 treesize of output 10 [2019-01-14 18:22:58,080 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:58,098 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:22:58,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2019-01-14 18:22:58,303 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2019-01-14 18:22:58,741 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-01-14 18:22:58,774 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:22:58,788 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:22:58,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2019-01-14 18:22:58,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:58,939 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:22:58,940 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:22:58,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2019-01-14 18:22:58,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:59,033 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:22:59,034 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:22:59,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2019-01-14 18:22:59,036 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:59,122 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:22:59,123 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:22:59,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2019-01-14 18:22:59,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:59,204 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:22:59,205 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 18:22:59,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2019-01-14 18:22:59,206 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 18:22:59,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2019-01-14 18:22:59,280 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:94, output treesize:33 [2019-01-14 18:22:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (15)] Exception during sending of exit command (exit): Broken pipe [2019-01-14 18:22:59,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:22:59,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2019-01-14 18:22:59,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 18:22:59,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 18:22:59,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-01-14 18:22:59,723 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 21 states. [2019-01-14 18:23:01,499 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-01-14 18:23:01,811 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-01-14 18:23:02,045 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 50 [2019-01-14 18:23:02,526 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2019-01-14 18:23:03,629 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-01-14 18:23:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:04,390 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-01-14 18:23:04,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 18:23:04,391 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-01-14 18:23:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:04,392 INFO L225 Difference]: With dead ends: 72 [2019-01-14 18:23:04,392 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 18:23:04,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-01-14 18:23:04,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 18:23:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-01-14 18:23:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-14 18:23:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-14 18:23:04,397 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 28 [2019-01-14 18:23:04,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:04,398 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-14 18:23:04,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 18:23:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-14 18:23:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 18:23:04,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:04,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:23:04,402 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:23:04,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:04,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1996044380, now seen corresponding path program 1 times [2019-01-14 18:23:04,403 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:23:04,403 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:23:04,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:04,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:23:04,536 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:23:04,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:23:04,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:23:04,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-14 18:23:04,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:23:04,573 INFO L478 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 8 treesize of output 7 [2019-01-14 18:23:04,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:23:04,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:23:04,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:23:04,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-14 18:23:04,610 INFO L478 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 15 [2019-01-14 18:23:04,612 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-01-14 18:23:04,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:23:04,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:23:04,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:23:04,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-01-14 18:23:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:23:04,627 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:23:04,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:04,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:23:04,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:23:04,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:23:04,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:23:04,630 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 8 states. [2019-01-14 18:23:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:05,061 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-01-14 18:23:05,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:23:05,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-01-14 18:23:05,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:05,064 INFO L225 Difference]: With dead ends: 69 [2019-01-14 18:23:05,064 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 18:23:05,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:23:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 18:23:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-14 18:23:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 18:23:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-01-14 18:23:05,069 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 28 [2019-01-14 18:23:05,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:05,069 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-01-14 18:23:05,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:23:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-01-14 18:23:05,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 18:23:05,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:05,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:23:05,074 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:23:05,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:05,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1747833559, now seen corresponding path program 1 times [2019-01-14 18:23:05,076 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:23:05,076 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:23:05,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:05,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:23:05,228 INFO L478 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-01-14 18:23:05,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:23:05,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:23:05,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 18:23:05,278 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:23:05,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:23:05,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:23:05,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2019-01-14 18:23:05,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:23:05,299 INFO L478 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 8 treesize of output 7 [2019-01-14 18:23:05,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:23:05,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:23:05,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:23:05,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-01-14 18:23:05,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:23:05,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:23:05,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2019-01-14 18:23:05,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:23:05,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:23:05,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2019-01-14 18:23:05,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-01-14 18:23:05,374 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2019-01-14 18:23:05,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:23:05,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:23:05,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:23:05,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-01-14 18:23:05,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:23:05,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-14 18:23:05,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:23:05,405 INFO L267 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-01-14 18:23:05,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-01-14 18:23:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:23:05,426 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:23:05,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:05,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:23:05,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:23:05,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:23:05,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:23:05,429 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 9 states. [2019-01-14 18:23:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:08,070 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-01-14 18:23:08,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:23:08,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-01-14 18:23:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:08,073 INFO L225 Difference]: With dead ends: 86 [2019-01-14 18:23:08,073 INFO L226 Difference]: Without dead ends: 86 [2019-01-14 18:23:08,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-14 18:23:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-14 18:23:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2019-01-14 18:23:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 18:23:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-01-14 18:23:08,076 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2019-01-14 18:23:08,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:08,076 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-01-14 18:23:08,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:23:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-01-14 18:23:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 18:23:08,077 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:08,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:23:08,078 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:23:08,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:08,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1747833558, now seen corresponding path program 1 times [2019-01-14 18:23:08,078 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:23:08,078 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:23:08,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:23:08,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:23:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:23:08,175 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 18:23:08,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:23:08,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:23:08,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:23:08,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:23:08,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:23:08,177 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 3 states. [2019-01-14 18:23:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:23:08,327 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-01-14 18:23:08,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:23:08,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-14 18:23:08,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:23:08,332 INFO L225 Difference]: With dead ends: 63 [2019-01-14 18:23:08,332 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 18:23:08,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-01-14 18:23:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 18:23:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-14 18:23:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 18:23:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-14 18:23:08,339 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 29 [2019-01-14 18:23:08,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:23:08,339 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-14 18:23:08,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:23:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-14 18:23:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 18:23:08,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:23:08,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:23:08,346 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION]=== [2019-01-14 18:23:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:23:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash -616510161, now seen corresponding path program 1 times [2019-01-14 18:23:08,348 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 18:23:08,348 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-14 18:23:08,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:23:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:23:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:23:08,785 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 18:23:08,806 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-14 18:23:08,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:23:08 BoogieIcfgContainer [2019-01-14 18:23:08,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:23:08,826 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:23:08,826 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:23:08,827 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:23:08,827 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:22:37" (3/4) ... [2019-01-14 18:23:08,834 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 18:23:08,834 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:23:08,835 INFO L168 Benchmark]: Toolchain (without parser) took 32946.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.5 MB). Free memory was 942.0 MB in the beginning and 1.0 GB in the end (delta: -60.0 MB). Peak memory consumption was 253.5 MB. Max. memory is 11.5 GB. [2019-01-14 18:23:08,836 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:23:08,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-01-14 18:23:08,836 INFO L168 Benchmark]: Boogie Preprocessor took 62.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:23:08,836 INFO L168 Benchmark]: RCFGBuilder took 1003.10 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: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2019-01-14 18:23:08,840 INFO L168 Benchmark]: TraceAbstraction took 31230.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.8 MB). Peak memory consumption was 228.9 MB. Max. memory is 11.5 GB. [2019-01-14 18:23:08,840 INFO L168 Benchmark]: Witness Printer took 8.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:23:08,844 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 636.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1003.10 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: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31230.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.8 MB). Peak memory consumption was 228.9 MB. Max. memory is 11.5 GB. * Witness Printer took 8.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] struct item *list = ((void *)0); VAL [list={-1142816753:0}] [L637] CALL append(&list) VAL [plist={-1142816753:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={1142816736:0}, malloc(sizeof *item)={1142816736:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={1142816736:0}, malloc(sizeof *item)={1142816736:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={1142816736:0}, malloc(sizeof *item)={1142816736:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L628] EXPR item->next VAL [item={1142816736:0}, item->next={0:0}, malloc(sizeof *item)={1142816736:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-605683697:0}, item={1142816736:0}, item->next={0:0}, malloc(sizeof *item)={1142816736:0}, malloc(sizeof *item)={-605683697:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-605683697:0}, item={1142816736:0}, item->next={0:0}, malloc(sizeof *item)={1142816736:0}, malloc(sizeof *item)={-605683697:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L631] *plist = item VAL [item={1142816736:0}, malloc(sizeof *item)={1142816736:0}, malloc(sizeof *item)={-605683697:0}, plist={-1142816753:0}, plist={-1142816753:0}] [L637] RET append(&list) VAL [list={-1142816753:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={1142816736:0}, list={-1142816753:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={1142816736:0}, list={-1142816753:0}] [L640] EXPR list->next VAL [\read(*list)={1142816736:0}, list={-1142816753:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={1142816736:0}, list={-1142816753:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={1142816736:0}, list={-1142816753:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={1142816736:0}, list={-1142816753:0}, next={0:0}] [L641] free(list) [L642] list = next VAL [list={-1142816753:0}, next={0:0}] [L644] \read(*list) VAL [\read(*list)={0:0}, list={-1142816753:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; [L635] struct item *list = ((void *)0); [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 91 locations, 41 error locations. UNSAFE Result, 31.1s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 17.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 770 SDtfs, 981 SDslu, 2126 SDs, 0 SdLazy, 2735 SolverSat, 136 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 60 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 380 ConstructedInterpolants, 44 QuantifiedInterpolants, 108957 SizeOfPredicates, 132 NumberOfNonLiveVariables, 1723 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...