./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 5a079682 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 534681b11e8e68e6058985d885b01f2cbfa43e5b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-5a07968 [2019-11-22 11:03:39,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 11:03:39,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 11:03:39,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 11:03:39,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 11:03:39,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 11:03:39,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 11:03:39,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 11:03:39,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 11:03:39,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 11:03:39,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 11:03:39,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 11:03:39,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 11:03:39,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 11:03:39,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 11:03:39,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 11:03:39,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 11:03:39,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 11:03:39,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 11:03:39,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 11:03:39,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 11:03:39,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 11:03:39,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 11:03:39,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 11:03:39,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 11:03:39,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 11:03:39,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 11:03:39,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 11:03:39,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 11:03:39,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 11:03:39,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 11:03:39,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 11:03:39,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 11:03:39,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 11:03:39,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 11:03:39,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 11:03:39,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 11:03:39,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 11:03:39,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 11:03:39,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 11:03:39,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 11:03:39,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Default.epf [2019-11-22 11:03:39,307 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 11:03:39,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 11:03:39,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 11:03:39,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 11:03:39,309 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 11:03:39,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 11:03:39,310 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 11:03:39,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 11:03:39,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 11:03:39,310 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 11:03:39,310 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 11:03:39,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 11:03:39,311 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 11:03:39,311 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 11:03:39,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 11:03:39,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 11:03:39,312 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 11:03:39,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 11:03:39,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:03:39,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 11:03:39,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 11:03:39,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 11:03:39,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 11:03:39,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 534681b11e8e68e6058985d885b01f2cbfa43e5b [2019-11-22 11:03:39,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 11:03:39,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 11:03:39,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 11:03:39,629 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 11:03:39,629 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 11:03:39,630 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-22 11:03:39,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/161b1efc8/576b243e45754c49a78ff26e7ac28f6e/FLAG3c95efa48 [2019-11-22 11:03:40,249 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 11:03:40,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-22 11:03:40,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/161b1efc8/576b243e45754c49a78ff26e7ac28f6e/FLAG3c95efa48 [2019-11-22 11:03:40,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/161b1efc8/576b243e45754c49a78ff26e7ac28f6e [2019-11-22 11:03:40,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 11:03:40,525 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 11:03:40,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 11:03:40,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 11:03:40,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 11:03:40,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:03:40" (1/1) ... [2019-11-22 11:03:40,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259afba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:03:40, skipping insertion in model container [2019-11-22 11:03:40,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:03:40" (1/1) ... [2019-11-22 11:03:40,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 11:03:40,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 11:03:41,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:03:41,024 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 11:03:41,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:03:41,163 INFO L208 MainTranslator]: Completed translation [2019-11-22 11:03:41,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:03:41 WrapperNode [2019-11-22 11:03:41,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 11:03:41,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 11:03:41,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 11:03:41,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 11:03:41,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:03:41" (1/1) ... [2019-11-22 11:03:41,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:03:41" (1/1) ... [2019-11-22 11:03:41,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:03:41" (1/1) ... [2019-11-22 11:03:41,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:03:41" (1/1) ... [2019-11-22 11:03:41,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:03:41" (1/1) ... [2019-11-22 11:03:41,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:03:41" (1/1) ... [2019-11-22 11:03:41,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:03:41" (1/1) ... [2019-11-22 11:03:41,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 11:03:41,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 11:03:41,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 11:03:41,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 11:03:41,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:03:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:03:41,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 11:03:41,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 11:03:41,331 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 11:03:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 11:03:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-11-22 11:03:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-11-22 11:03:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-11-22 11:03:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-11-22 11:03:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-11-22 11:03:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-11-22 11:03:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 11:03:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 11:03:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 11:03:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 11:03:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 11:03:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 11:03:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 11:03:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 11:03:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 11:03:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 11:03:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 11:03:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 11:03:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 11:03:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 11:03:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 11:03:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 11:03:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 11:03:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 11:03:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 11:03:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 11:03:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 11:03:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 11:03:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 11:03:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 11:03:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 11:03:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 11:03:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 11:03:41,340 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 11:03:41,340 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 11:03:41,340 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 11:03:41,340 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 11:03:41,340 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 11:03:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 11:03:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 11:03:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 11:03:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 11:03:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 11:03:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 11:03:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 11:03:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 11:03:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 11:03:41,343 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 11:03:41,343 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 11:03:41,343 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 11:03:41,344 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 11:03:41,344 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 11:03:41,344 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 11:03:41,344 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 11:03:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 11:03:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 11:03:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 11:03:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 11:03:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 11:03:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 11:03:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 11:03:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 11:03:41,347 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 11:03:41,347 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 11:03:41,347 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 11:03:41,347 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 11:03:41,348 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 11:03:41,348 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 11:03:41,348 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 11:03:41,348 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 11:03:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 11:03:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 11:03:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 11:03:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 11:03:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 11:03:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 11:03:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 11:03:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 11:03:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 11:03:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 11:03:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 11:03:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 11:03:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 11:03:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 11:03:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 11:03:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 11:03:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 11:03:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 11:03:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 11:03:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 11:03:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 11:03:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 11:03:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 11:03:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 11:03:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 11:03:41,355 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 11:03:41,355 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 11:03:41,355 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 11:03:41,355 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 11:03:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 11:03:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 11:03:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 11:03:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 11:03:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 11:03:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 11:03:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 11:03:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 11:03:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 11:03:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 11:03:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 11:03:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 11:03:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-11-22 11:03:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-11-22 11:03:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 11:03:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 11:03:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-11-22 11:03:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 11:03:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 11:03:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 11:03:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-11-22 11:03:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-11-22 11:03:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-11-22 11:03:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 11:03:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 11:03:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 11:03:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 11:03:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 11:03:42,687 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 11:03:42,688 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-11-22 11:03:42,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:03:42 BoogieIcfgContainer [2019-11-22 11:03:42,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 11:03:42,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 11:03:42,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 11:03:42,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 11:03:42,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:03:40" (1/3) ... [2019-11-22 11:03:42,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c8aa06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:03:42, skipping insertion in model container [2019-11-22 11:03:42,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:03:41" (2/3) ... [2019-11-22 11:03:42,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c8aa06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:03:42, skipping insertion in model container [2019-11-22 11:03:42,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:03:42" (3/3) ... [2019-11-22 11:03:42,708 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2019-11-22 11:03:42,719 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 11:03:42,730 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 104 error locations. [2019-11-22 11:03:42,741 INFO L249 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2019-11-22 11:03:42,760 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 11:03:42,761 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 11:03:42,761 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 11:03:42,761 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 11:03:42,761 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 11:03:42,762 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 11:03:42,762 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 11:03:42,762 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 11:03:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states. [2019-11-22 11:03:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 11:03:42,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:42,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:42,802 INFO L410 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:42,808 INFO L82 PathProgramCache]: Analyzing trace with hash 995848786, now seen corresponding path program 1 times [2019-11-22 11:03:42,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:42,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367711217] [2019-11-22 11:03:42,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:42,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367711217] [2019-11-22 11:03:42,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:42,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 11:03:42,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018201384] [2019-11-22 11:03:42,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 11:03:42,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:43,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 11:03:43,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:03:43,008 INFO L87 Difference]: Start difference. First operand 278 states. Second operand 3 states. [2019-11-22 11:03:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:43,584 INFO L93 Difference]: Finished difference Result 318 states and 353 transitions. [2019-11-22 11:03:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 11:03:43,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-22 11:03:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:43,606 INFO L225 Difference]: With dead ends: 318 [2019-11-22 11:03:43,606 INFO L226 Difference]: Without dead ends: 300 [2019-11-22 11:03:43,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:03:43,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-22 11:03:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 262. [2019-11-22 11:03:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-22 11:03:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 276 transitions. [2019-11-22 11:03:43,682 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 276 transitions. Word has length 9 [2019-11-22 11:03:43,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:43,683 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 276 transitions. [2019-11-22 11:03:43,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 11:03:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 276 transitions. [2019-11-22 11:03:43,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 11:03:43,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:43,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:43,687 INFO L410 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:43,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:43,687 INFO L82 PathProgramCache]: Analyzing trace with hash 805494535, now seen corresponding path program 1 times [2019-11-22 11:03:43,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:43,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395226580] [2019-11-22 11:03:43,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:43,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395226580] [2019-11-22 11:03:43,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:43,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 11:03:43,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433171351] [2019-11-22 11:03:43,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:03:43,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:43,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:03:43,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:03:43,838 INFO L87 Difference]: Start difference. First operand 262 states and 276 transitions. Second operand 4 states. [2019-11-22 11:03:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:44,545 INFO L93 Difference]: Finished difference Result 317 states and 342 transitions. [2019-11-22 11:03:44,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:03:44,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 11:03:44,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:44,550 INFO L225 Difference]: With dead ends: 317 [2019-11-22 11:03:44,550 INFO L226 Difference]: Without dead ends: 317 [2019-11-22 11:03:44,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:03:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-22 11:03:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 260. [2019-11-22 11:03:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-22 11:03:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 274 transitions. [2019-11-22 11:03:44,571 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 274 transitions. Word has length 10 [2019-11-22 11:03:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:44,572 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 274 transitions. [2019-11-22 11:03:44,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:03:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 274 transitions. [2019-11-22 11:03:44,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 11:03:44,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:44,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:44,574 INFO L410 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:44,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:44,574 INFO L82 PathProgramCache]: Analyzing trace with hash 805494536, now seen corresponding path program 1 times [2019-11-22 11:03:44,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:44,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851580268] [2019-11-22 11:03:44,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:44,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851580268] [2019-11-22 11:03:44,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:44,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 11:03:44,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737126950] [2019-11-22 11:03:44,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:03:44,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:44,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:03:44,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:03:44,670 INFO L87 Difference]: Start difference. First operand 260 states and 274 transitions. Second operand 4 states. [2019-11-22 11:03:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:45,327 INFO L93 Difference]: Finished difference Result 296 states and 318 transitions. [2019-11-22 11:03:45,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:03:45,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 11:03:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:45,331 INFO L225 Difference]: With dead ends: 296 [2019-11-22 11:03:45,331 INFO L226 Difference]: Without dead ends: 296 [2019-11-22 11:03:45,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:03:45,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-22 11:03:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 258. [2019-11-22 11:03:45,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-22 11:03:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 272 transitions. [2019-11-22 11:03:45,347 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 272 transitions. Word has length 10 [2019-11-22 11:03:45,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:45,348 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 272 transitions. [2019-11-22 11:03:45,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:03:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 272 transitions. [2019-11-22 11:03:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-22 11:03:45,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:45,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:45,349 INFO L410 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:45,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:45,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1991342111, now seen corresponding path program 1 times [2019-11-22 11:03:45,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:45,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849179372] [2019-11-22 11:03:45,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:45,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849179372] [2019-11-22 11:03:45,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:45,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 11:03:45,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889859838] [2019-11-22 11:03:45,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:03:45,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:45,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:03:45,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:03:45,406 INFO L87 Difference]: Start difference. First operand 258 states and 272 transitions. Second operand 4 states. [2019-11-22 11:03:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:45,955 INFO L93 Difference]: Finished difference Result 293 states and 308 transitions. [2019-11-22 11:03:45,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:03:45,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-22 11:03:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:45,958 INFO L225 Difference]: With dead ends: 293 [2019-11-22 11:03:45,958 INFO L226 Difference]: Without dead ends: 292 [2019-11-22 11:03:45,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 11:03:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-22 11:03:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 257. [2019-11-22 11:03:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-22 11:03:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 270 transitions. [2019-11-22 11:03:45,976 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 270 transitions. Word has length 14 [2019-11-22 11:03:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:45,976 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 270 transitions. [2019-11-22 11:03:45,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:03:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 270 transitions. [2019-11-22 11:03:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 11:03:45,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:45,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:45,978 INFO L410 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:45,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:45,978 INFO L82 PathProgramCache]: Analyzing trace with hash 742236455, now seen corresponding path program 1 times [2019-11-22 11:03:45,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:45,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700196527] [2019-11-22 11:03:45,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:46,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700196527] [2019-11-22 11:03:46,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:46,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 11:03:46,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958315057] [2019-11-22 11:03:46,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:03:46,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:03:46,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:03:46,034 INFO L87 Difference]: Start difference. First operand 257 states and 270 transitions. Second operand 4 states. [2019-11-22 11:03:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:46,522 INFO L93 Difference]: Finished difference Result 299 states and 318 transitions. [2019-11-22 11:03:46,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:03:46,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-22 11:03:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:46,526 INFO L225 Difference]: With dead ends: 299 [2019-11-22 11:03:46,526 INFO L226 Difference]: Without dead ends: 299 [2019-11-22 11:03:46,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:03:46,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-22 11:03:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2019-11-22 11:03:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-22 11:03:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 268 transitions. [2019-11-22 11:03:46,536 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 268 transitions. Word has length 15 [2019-11-22 11:03:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:46,536 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 268 transitions. [2019-11-22 11:03:46,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:03:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 268 transitions. [2019-11-22 11:03:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 11:03:46,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:46,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:46,537 INFO L410 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:46,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash 742236456, now seen corresponding path program 1 times [2019-11-22 11:03:46,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:46,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970081098] [2019-11-22 11:03:46,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:46,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970081098] [2019-11-22 11:03:46,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:46,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 11:03:46,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853510617] [2019-11-22 11:03:46,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:03:46,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:46,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:03:46,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:03:46,608 INFO L87 Difference]: Start difference. First operand 255 states and 268 transitions. Second operand 4 states. [2019-11-22 11:03:47,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:47,158 INFO L93 Difference]: Finished difference Result 303 states and 323 transitions. [2019-11-22 11:03:47,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:03:47,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-22 11:03:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:47,161 INFO L225 Difference]: With dead ends: 303 [2019-11-22 11:03:47,161 INFO L226 Difference]: Without dead ends: 303 [2019-11-22 11:03:47,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:03:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-22 11:03:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 253. [2019-11-22 11:03:47,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-22 11:03:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2019-11-22 11:03:47,171 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 15 [2019-11-22 11:03:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:47,172 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2019-11-22 11:03:47,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:03:47,172 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2019-11-22 11:03:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 11:03:47,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:47,173 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:47,173 INFO L410 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:47,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash -224686077, now seen corresponding path program 1 times [2019-11-22 11:03:47,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:47,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367760496] [2019-11-22 11:03:47,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:47,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367760496] [2019-11-22 11:03:47,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:47,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:03:47,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636045759] [2019-11-22 11:03:47,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 11:03:47,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:47,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 11:03:47,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 11:03:47,233 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand 5 states. [2019-11-22 11:03:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:47,894 INFO L93 Difference]: Finished difference Result 312 states and 332 transitions. [2019-11-22 11:03:47,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:03:47,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-22 11:03:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:47,897 INFO L225 Difference]: With dead ends: 312 [2019-11-22 11:03:47,897 INFO L226 Difference]: Without dead ends: 312 [2019-11-22 11:03:47,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:03:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-22 11:03:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 253. [2019-11-22 11:03:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-22 11:03:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions. [2019-11-22 11:03:47,909 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 21 [2019-11-22 11:03:47,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:47,910 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions. [2019-11-22 11:03:47,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 11:03:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions. [2019-11-22 11:03:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 11:03:47,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:47,911 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:47,912 INFO L410 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:47,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:47,913 INFO L82 PathProgramCache]: Analyzing trace with hash 552515561, now seen corresponding path program 1 times [2019-11-22 11:03:47,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:47,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584778711] [2019-11-22 11:03:47,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:48,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584778711] [2019-11-22 11:03:48,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:48,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:03:48,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663017961] [2019-11-22 11:03:48,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:03:48,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:48,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:03:48,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:03:48,056 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand 7 states. [2019-11-22 11:03:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:48,978 INFO L93 Difference]: Finished difference Result 293 states and 312 transitions. [2019-11-22 11:03:48,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:03:48,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-22 11:03:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:48,982 INFO L225 Difference]: With dead ends: 293 [2019-11-22 11:03:48,982 INFO L226 Difference]: Without dead ends: 293 [2019-11-22 11:03:48,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:03:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-22 11:03:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 246. [2019-11-22 11:03:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-22 11:03:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 260 transitions. [2019-11-22 11:03:48,991 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 260 transitions. Word has length 25 [2019-11-22 11:03:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:48,991 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 260 transitions. [2019-11-22 11:03:48,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:03:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 260 transitions. [2019-11-22 11:03:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 11:03:48,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:48,993 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:48,993 INFO L410 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:48,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:48,993 INFO L82 PathProgramCache]: Analyzing trace with hash 552515562, now seen corresponding path program 1 times [2019-11-22 11:03:48,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:48,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54383254] [2019-11-22 11:03:48,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:49,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54383254] [2019-11-22 11:03:49,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:49,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:03:49,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161035720] [2019-11-22 11:03:49,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:03:49,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:49,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:03:49,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:03:49,139 INFO L87 Difference]: Start difference. First operand 246 states and 260 transitions. Second operand 7 states. [2019-11-22 11:03:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:50,183 INFO L93 Difference]: Finished difference Result 322 states and 342 transitions. [2019-11-22 11:03:50,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 11:03:50,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-22 11:03:50,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:50,187 INFO L225 Difference]: With dead ends: 322 [2019-11-22 11:03:50,187 INFO L226 Difference]: Without dead ends: 322 [2019-11-22 11:03:50,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:03:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-22 11:03:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 274. [2019-11-22 11:03:50,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-22 11:03:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 291 transitions. [2019-11-22 11:03:50,201 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 291 transitions. Word has length 25 [2019-11-22 11:03:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:50,204 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 291 transitions. [2019-11-22 11:03:50,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:03:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 291 transitions. [2019-11-22 11:03:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 11:03:50,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:50,207 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:50,208 INFO L410 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:50,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:50,208 INFO L82 PathProgramCache]: Analyzing trace with hash 690194188, now seen corresponding path program 1 times [2019-11-22 11:03:50,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:50,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319844666] [2019-11-22 11:03:50,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:50,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319844666] [2019-11-22 11:03:50,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:50,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 11:03:50,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117591679] [2019-11-22 11:03:50,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 11:03:50,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:50,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 11:03:50,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:03:50,469 INFO L87 Difference]: Start difference. First operand 274 states and 291 transitions. Second operand 11 states. [2019-11-22 11:03:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:52,207 INFO L93 Difference]: Finished difference Result 340 states and 364 transitions. [2019-11-22 11:03:52,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 11:03:52,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-22 11:03:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:52,211 INFO L225 Difference]: With dead ends: 340 [2019-11-22 11:03:52,211 INFO L226 Difference]: Without dead ends: 340 [2019-11-22 11:03:52,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-22 11:03:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-22 11:03:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 275. [2019-11-22 11:03:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-22 11:03:52,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 293 transitions. [2019-11-22 11:03:52,220 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 293 transitions. Word has length 36 [2019-11-22 11:03:52,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:52,221 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 293 transitions. [2019-11-22 11:03:52,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 11:03:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 293 transitions. [2019-11-22 11:03:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 11:03:52,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:52,222 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:52,222 INFO L410 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:52,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:52,223 INFO L82 PathProgramCache]: Analyzing trace with hash 690194189, now seen corresponding path program 1 times [2019-11-22 11:03:52,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:52,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120139349] [2019-11-22 11:03:52,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:52,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120139349] [2019-11-22 11:03:52,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:52,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 11:03:52,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100939642] [2019-11-22 11:03:52,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 11:03:52,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:52,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 11:03:52,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:03:52,384 INFO L87 Difference]: Start difference. First operand 275 states and 293 transitions. Second operand 11 states. [2019-11-22 11:03:54,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:54,056 INFO L93 Difference]: Finished difference Result 324 states and 344 transitions. [2019-11-22 11:03:54,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:03:54,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-22 11:03:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:54,059 INFO L225 Difference]: With dead ends: 324 [2019-11-22 11:03:54,060 INFO L226 Difference]: Without dead ends: 324 [2019-11-22 11:03:54,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-22 11:03:54,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-22 11:03:54,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 275. [2019-11-22 11:03:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-22 11:03:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 292 transitions. [2019-11-22 11:03:54,069 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 292 transitions. Word has length 36 [2019-11-22 11:03:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:54,069 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 292 transitions. [2019-11-22 11:03:54,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 11:03:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 292 transitions. [2019-11-22 11:03:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 11:03:54,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:54,071 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:54,071 INFO L410 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:54,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1511282514, now seen corresponding path program 1 times [2019-11-22 11:03:54,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:54,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114679824] [2019-11-22 11:03:54,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:54,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114679824] [2019-11-22 11:03:54,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:54,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 11:03:54,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949528202] [2019-11-22 11:03:54,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 11:03:54,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:54,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 11:03:54,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:03:54,226 INFO L87 Difference]: Start difference. First operand 275 states and 292 transitions. Second operand 11 states. [2019-11-22 11:03:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:55,897 INFO L93 Difference]: Finished difference Result 338 states and 362 transitions. [2019-11-22 11:03:55,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 11:03:55,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-22 11:03:55,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:55,903 INFO L225 Difference]: With dead ends: 338 [2019-11-22 11:03:55,903 INFO L226 Difference]: Without dead ends: 338 [2019-11-22 11:03:55,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-22 11:03:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-22 11:03:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 275. [2019-11-22 11:03:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-22 11:03:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 291 transitions. [2019-11-22 11:03:55,912 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 291 transitions. Word has length 36 [2019-11-22 11:03:55,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:55,913 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 291 transitions. [2019-11-22 11:03:55,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 11:03:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 291 transitions. [2019-11-22 11:03:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 11:03:55,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:55,914 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:55,914 INFO L410 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:55,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:55,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1511282513, now seen corresponding path program 1 times [2019-11-22 11:03:55,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:55,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035656856] [2019-11-22 11:03:55,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:56,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035656856] [2019-11-22 11:03:56,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:56,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 11:03:56,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943081624] [2019-11-22 11:03:56,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:03:56,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:56,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:03:56,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:03:56,107 INFO L87 Difference]: Start difference. First operand 275 states and 291 transitions. Second operand 10 states. [2019-11-22 11:03:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:57,623 INFO L93 Difference]: Finished difference Result 322 states and 342 transitions. [2019-11-22 11:03:57,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:03:57,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-11-22 11:03:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:57,631 INFO L225 Difference]: With dead ends: 322 [2019-11-22 11:03:57,631 INFO L226 Difference]: Without dead ends: 322 [2019-11-22 11:03:57,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-22 11:03:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-22 11:03:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 275. [2019-11-22 11:03:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-22 11:03:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 290 transitions. [2019-11-22 11:03:57,645 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 290 transitions. Word has length 36 [2019-11-22 11:03:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:57,648 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 290 transitions. [2019-11-22 11:03:57,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:03:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 290 transitions. [2019-11-22 11:03:57,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-22 11:03:57,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:57,654 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:57,654 INFO L410 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:57,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:57,655 INFO L82 PathProgramCache]: Analyzing trace with hash 801871937, now seen corresponding path program 1 times [2019-11-22 11:03:57,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:57,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326710958] [2019-11-22 11:03:57,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:57,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326710958] [2019-11-22 11:03:57,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:57,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-22 11:03:57,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218901983] [2019-11-22 11:03:57,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 11:03:57,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:57,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 11:03:57,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-22 11:03:57,918 INFO L87 Difference]: Start difference. First operand 275 states and 290 transitions. Second operand 13 states. [2019-11-22 11:03:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:59,631 INFO L93 Difference]: Finished difference Result 276 states and 294 transitions. [2019-11-22 11:03:59,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 11:03:59,632 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2019-11-22 11:03:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:59,634 INFO L225 Difference]: With dead ends: 276 [2019-11-22 11:03:59,634 INFO L226 Difference]: Without dead ends: 265 [2019-11-22 11:03:59,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2019-11-22 11:03:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-11-22 11:03:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 223. [2019-11-22 11:03:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-22 11:03:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 236 transitions. [2019-11-22 11:03:59,645 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 236 transitions. Word has length 41 [2019-11-22 11:03:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:59,647 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 236 transitions. [2019-11-22 11:03:59,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 11:03:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 236 transitions. [2019-11-22 11:03:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-22 11:03:59,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:59,648 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:59,648 INFO L410 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:59,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:59,649 INFO L82 PathProgramCache]: Analyzing trace with hash 257285329, now seen corresponding path program 1 times [2019-11-22 11:03:59,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:59,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424994910] [2019-11-22 11:03:59,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:59,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424994910] [2019-11-22 11:03:59,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:59,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:03:59,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480897057] [2019-11-22 11:03:59,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:03:59,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:59,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:03:59,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:03:59,752 INFO L87 Difference]: Start difference. First operand 223 states and 236 transitions. Second operand 7 states. [2019-11-22 11:04:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:04:00,584 INFO L93 Difference]: Finished difference Result 266 states and 287 transitions. [2019-11-22 11:04:00,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:04:00,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-11-22 11:04:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:04:00,588 INFO L225 Difference]: With dead ends: 266 [2019-11-22 11:04:00,588 INFO L226 Difference]: Without dead ends: 266 [2019-11-22 11:04:00,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:04:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-22 11:04:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 223. [2019-11-22 11:04:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-22 11:04:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2019-11-22 11:04:00,594 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 46 [2019-11-22 11:04:00,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:04:00,594 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2019-11-22 11:04:00,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:04:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2019-11-22 11:04:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-22 11:04:00,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:04:00,595 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:04:00,595 INFO L410 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:04:00,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:04:00,596 INFO L82 PathProgramCache]: Analyzing trace with hash 257285330, now seen corresponding path program 1 times [2019-11-22 11:04:00,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:04:00,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334220491] [2019-11-22 11:04:00,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:04:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:04:00,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334220491] [2019-11-22 11:04:00,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:04:00,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:04:00,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410910431] [2019-11-22 11:04:00,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:04:00,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:04:00,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:04:00,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:04:00,700 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 7 states. [2019-11-22 11:04:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:04:01,515 INFO L93 Difference]: Finished difference Result 272 states and 292 transitions. [2019-11-22 11:04:01,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:04:01,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-11-22 11:04:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:04:01,518 INFO L225 Difference]: With dead ends: 272 [2019-11-22 11:04:01,518 INFO L226 Difference]: Without dead ends: 272 [2019-11-22 11:04:01,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:04:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-22 11:04:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 242. [2019-11-22 11:04:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-22 11:04:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 262 transitions. [2019-11-22 11:04:01,524 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 262 transitions. Word has length 46 [2019-11-22 11:04:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:04:01,525 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 262 transitions. [2019-11-22 11:04:01,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:04:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 262 transitions. [2019-11-22 11:04:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-22 11:04:01,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:04:01,525 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:04:01,526 INFO L410 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:04:01,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:04:01,526 INFO L82 PathProgramCache]: Analyzing trace with hash -679135460, now seen corresponding path program 1 times [2019-11-22 11:04:01,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:04:01,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124627604] [2019-11-22 11:04:01,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:04:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 11:04:01,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124627604] [2019-11-22 11:04:01,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:04:01,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:04:01,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624805408] [2019-11-22 11:04:01,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:04:01,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:04:01,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:04:01,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:04:01,581 INFO L87 Difference]: Start difference. First operand 242 states and 262 transitions. Second operand 6 states. [2019-11-22 11:04:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:04:02,148 INFO L93 Difference]: Finished difference Result 248 states and 267 transitions. [2019-11-22 11:04:02,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 11:04:02,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-22 11:04:02,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:04:02,150 INFO L225 Difference]: With dead ends: 248 [2019-11-22 11:04:02,150 INFO L226 Difference]: Without dead ends: 248 [2019-11-22 11:04:02,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:04:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-22 11:04:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 239. [2019-11-22 11:04:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-22 11:04:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 259 transitions. [2019-11-22 11:04:02,156 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 259 transitions. Word has length 47 [2019-11-22 11:04:02,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:04:02,156 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 259 transitions. [2019-11-22 11:04:02,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:04:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 259 transitions. [2019-11-22 11:04:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-22 11:04:02,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:04:02,157 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:04:02,157 INFO L410 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:04:02,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:04:02,158 INFO L82 PathProgramCache]: Analyzing trace with hash -679135459, now seen corresponding path program 1 times [2019-11-22 11:04:02,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:04:02,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939974326] [2019-11-22 11:04:02,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:04:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:04:02,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939974326] [2019-11-22 11:04:02,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:04:02,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:04:02,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968611509] [2019-11-22 11:04:02,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:04:02,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:04:02,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:04:02,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:04:02,253 INFO L87 Difference]: Start difference. First operand 239 states and 259 transitions. Second operand 7 states. [2019-11-22 11:04:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:04:03,087 INFO L93 Difference]: Finished difference Result 291 states and 310 transitions. [2019-11-22 11:04:03,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 11:04:03,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-22 11:04:03,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:04:03,091 INFO L225 Difference]: With dead ends: 291 [2019-11-22 11:04:03,091 INFO L226 Difference]: Without dead ends: 291 [2019-11-22 11:04:03,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:04:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-22 11:04:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 260. [2019-11-22 11:04:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-22 11:04:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 286 transitions. [2019-11-22 11:04:03,098 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 286 transitions. Word has length 47 [2019-11-22 11:04:03,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:04:03,098 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 286 transitions. [2019-11-22 11:04:03,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:04:03,098 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 286 transitions. [2019-11-22 11:04:03,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-22 11:04:03,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:04:03,099 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:04:03,099 INFO L410 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:04:03,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:04:03,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2077484617, now seen corresponding path program 1 times [2019-11-22 11:04:03,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:04:03,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122672408] [2019-11-22 11:04:03,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:04:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:04:03,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122672408] [2019-11-22 11:04:03,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:04:03,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 11:04:03,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139784089] [2019-11-22 11:04:03,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:04:03,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:04:03,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:04:03,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:04:03,204 INFO L87 Difference]: Start difference. First operand 260 states and 286 transitions. Second operand 8 states. [2019-11-22 11:04:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:04:04,082 INFO L93 Difference]: Finished difference Result 310 states and 334 transitions. [2019-11-22 11:04:04,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:04:04,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-22 11:04:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:04:04,085 INFO L225 Difference]: With dead ends: 310 [2019-11-22 11:04:04,085 INFO L226 Difference]: Without dead ends: 307 [2019-11-22 11:04:04,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-22 11:04:04,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-22 11:04:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-11-22 11:04:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-22 11:04:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2019-11-22 11:04:04,095 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 50 [2019-11-22 11:04:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:04:04,095 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2019-11-22 11:04:04,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:04:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2019-11-22 11:04:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-22 11:04:04,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:04:04,097 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:04:04,097 INFO L410 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-22 11:04:04,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:04:04,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2056453987, now seen corresponding path program 1 times [2019-11-22 11:04:04,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:04:04,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966289184] [2019-11-22 11:04:04,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:04:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:04:04,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966289184] [2019-11-22 11:04:04,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:04:04,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-22 11:04:04,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917944995] [2019-11-22 11:04:04,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-22 11:04:04,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:04:04,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-22 11:04:04,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-11-22 11:04:04,438 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand 15 states. [2019-11-22 11:04:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:04:05,274 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-11-22 11:04:05,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-22 11:04:05,275 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-11-22 11:04:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:04:05,275 INFO L225 Difference]: With dead ends: 44 [2019-11-22 11:04:05,276 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 11:04:05,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-11-22 11:04:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 11:04:05,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 11:04:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 11:04:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 11:04:05,277 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-11-22 11:04:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:04:05,277 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 11:04:05,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-22 11:04:05,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 11:04:05,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 11:04:05,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:04:05 BoogieIcfgContainer [2019-11-22 11:04:05,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 11:04:05,284 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 11:04:05,284 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 11:04:05,284 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 11:04:05,284 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:03:42" (3/4) ... [2019-11-22 11:04:05,290 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 11:04:05,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fail [2019-11-22 11:04:05,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 11:04:05,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_pair [2019-11-22 11:04:05,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_single_node [2019-11-22 11:04:05,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-22 11:04:05,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure seq_sort_core [2019-11-22 11:04:05,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-22 11:04:05,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_before [2019-11-22 11:04:05,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 11:04:05,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_after [2019-11-22 11:04:05,309 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-11-22 11:04:05,310 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-22 11:04:05,310 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-22 11:04:05,311 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 11:04:05,392 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 11:04:05,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 11:04:05,395 INFO L168 Benchmark]: Toolchain (without parser) took 24869.89 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 461.9 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -333.4 MB). Peak memory consumption was 128.5 MB. Max. memory is 11.5 GB. [2019-11-22 11:04:05,395 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 11:04:05,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 638.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-22 11:04:05,396 INFO L168 Benchmark]: Boogie Preprocessor took 103.54 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-22 11:04:05,397 INFO L168 Benchmark]: RCFGBuilder took 1421.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.9 MB). Peak memory consumption was 97.9 MB. Max. memory is 11.5 GB. [2019-11-22 11:04:05,397 INFO L168 Benchmark]: TraceAbstraction took 22590.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -299.9 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. [2019-11-22 11:04:05,397 INFO L168 Benchmark]: Witness Printer took 109.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-22 11:04:05,400 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 638.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.54 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1421.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.9 MB). Peak memory consumption was 97.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22590.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -299.9 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. * Witness Printer took 109.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 644]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 644]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 104 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 284 locations, 104 error locations. Result: SAFE, OverallTime: 22.5s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3574 SDtfs, 4648 SDslu, 5549 SDs, 0 SdLazy, 16089 SolverSat, 490 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 842 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 615 NumberOfCodeBlocks, 615 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 141356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 30/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...