./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c9c8a757 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-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 534681b11e8e68e6058985d885b01f2cbfa43e5b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.24-c9c8a75 [2019-11-28 10:20:05,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 10:20:05,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 10:20:05,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 10:20:05,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 10:20:05,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 10:20:05,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 10:20:05,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 10:20:05,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 10:20:05,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 10:20:05,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 10:20:05,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 10:20:05,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 10:20:05,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 10:20:05,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 10:20:05,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 10:20:05,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 10:20:05,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 10:20:05,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 10:20:05,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 10:20:05,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 10:20:05,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 10:20:05,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 10:20:05,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 10:20:05,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 10:20:05,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 10:20:05,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 10:20:05,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 10:20:05,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 10:20:05,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 10:20:05,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 10:20:05,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 10:20:05,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 10:20:05,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 10:20:05,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 10:20:05,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 10:20:05,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 10:20:05,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 10:20:05,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 10:20:05,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 10:20:05,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 10:20:05,404 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-28 10:20:05,429 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 10:20:05,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 10:20:05,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 10:20:05,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 10:20:05,431 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 10:20:05,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 10:20:05,432 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 10:20:05,432 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 10:20:05,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 10:20:05,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 10:20:05,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 10:20:05,433 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 10:20:05,433 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 10:20:05,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 10:20:05,434 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 10:20:05,434 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 10:20:05,434 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 10:20:05,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 10:20:05,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 10:20:05,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 10:20:05,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 10:20:05,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:20:05,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 10:20:05,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 10:20:05,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 10:20:05,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 10:20:05,437 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 534681b11e8e68e6058985d885b01f2cbfa43e5b [2019-11-28 10:20:05,726 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 10:20:05,740 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 10:20:05,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 10:20:05,745 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 10:20:05,745 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 10:20:05,746 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-28 10:20:05,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbdf6d9e8/4314fdad9dcf4a98a3543ebbff8cd34e/FLAG6004f6f31 [2019-11-28 10:20:06,351 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 10:20:06,352 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-28 10:20:06,377 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbdf6d9e8/4314fdad9dcf4a98a3543ebbff8cd34e/FLAG6004f6f31 [2019-11-28 10:20:06,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbdf6d9e8/4314fdad9dcf4a98a3543ebbff8cd34e [2019-11-28 10:20:06,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 10:20:06,660 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 10:20:06,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 10:20:06,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 10:20:06,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 10:20:06,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:20:06" (1/1) ... [2019-11-28 10:20:06,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc51a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:06, skipping insertion in model container [2019-11-28 10:20:06,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:20:06" (1/1) ... [2019-11-28 10:20:06,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 10:20:06,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:20:07,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:20:07,165 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 10:20:07,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:20:07,315 INFO L208 MainTranslator]: Completed translation [2019-11-28 10:20:07,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:07 WrapperNode [2019-11-28 10:20:07,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 10:20:07,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 10:20:07,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 10:20:07,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 10:20:07,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:07" (1/1) ... [2019-11-28 10:20:07,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:07" (1/1) ... [2019-11-28 10:20:07,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:07" (1/1) ... [2019-11-28 10:20:07,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:07" (1/1) ... [2019-11-28 10:20:07,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:07" (1/1) ... [2019-11-28 10:20:07,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:07" (1/1) ... [2019-11-28 10:20:07,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:07" (1/1) ... [2019-11-28 10:20:07,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 10:20:07,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 10:20:07,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 10:20:07,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 10:20:07,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:07" (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-28 10:20:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 10:20:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 10:20:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 10:20:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 10:20:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-11-28 10:20:07,472 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-11-28 10:20:07,472 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-11-28 10:20:07,473 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-11-28 10:20:07,474 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-11-28 10:20:07,474 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-11-28 10:20:07,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 10:20:07,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 10:20:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 10:20:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 10:20:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 10:20:07,477 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 10:20:07,477 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 10:20:07,477 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 10:20:07,480 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 10:20:07,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 10:20:07,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 10:20:07,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 10:20:07,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 10:20:07,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 10:20:07,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 10:20:07,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 10:20:07,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 10:20:07,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 10:20:07,482 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 10:20:07,482 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 10:20:07,482 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 10:20:07,482 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 10:20:07,483 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 10:20:07,483 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 10:20:07,483 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 10:20:07,483 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 10:20:07,483 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 10:20:07,483 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 10:20:07,484 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 10:20:07,484 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 10:20:07,484 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 10:20:07,484 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 10:20:07,484 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 10:20:07,485 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 10:20:07,485 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 10:20:07,486 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 10:20:07,486 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 10:20:07,486 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 10:20:07,486 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 10:20:07,486 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 10:20:07,486 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 10:20:07,487 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 10:20:07,487 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 10:20:07,487 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 10:20:07,487 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 10:20:07,488 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 10:20:07,488 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 10:20:07,488 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 10:20:07,488 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 10:20:07,488 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 10:20:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 10:20:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 10:20:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 10:20:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 10:20:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 10:20:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 10:20:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 10:20:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 10:20:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-28 10:20:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 10:20:07,491 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 10:20:07,491 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 10:20:07,491 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 10:20:07,491 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 10:20:07,492 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 10:20:07,492 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 10:20:07,493 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 10:20:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 10:20:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 10:20:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 10:20:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 10:20:07,495 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 10:20:07,495 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 10:20:07,495 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 10:20:07,495 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 10:20:07,495 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 10:20:07,495 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 10:20:07,496 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 10:20:07,496 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 10:20:07,497 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 10:20:07,497 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 10:20:07,497 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 10:20:07,497 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 10:20:07,497 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 10:20:07,497 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 10:20:07,497 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 10:20:07,497 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 10:20:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 10:20:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 10:20:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 10:20:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 10:20:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 10:20:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 10:20:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 10:20:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 10:20:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 10:20:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 10:20:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 10:20:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 10:20:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 10:20:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 10:20:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 10:20:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 10:20:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 10:20:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 10:20:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-11-28 10:20:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-11-28 10:20:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 10:20:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 10:20:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-11-28 10:20:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 10:20:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 10:20:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 10:20:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-11-28 10:20:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-11-28 10:20:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-11-28 10:20:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 10:20:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 10:20:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 10:20:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 10:20:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 10:20:08,561 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 10:20:08,562 INFO L297 CfgBuilder]: Removed 33 assume(true) statements. [2019-11-28 10:20:08,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:20:08 BoogieIcfgContainer [2019-11-28 10:20:08,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 10:20:08,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 10:20:08,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 10:20:08,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 10:20:08,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:20:06" (1/3) ... [2019-11-28 10:20:08,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c4587e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:20:08, skipping insertion in model container [2019-11-28 10:20:08,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:20:07" (2/3) ... [2019-11-28 10:20:08,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c4587e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:20:08, skipping insertion in model container [2019-11-28 10:20:08,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:20:08" (3/3) ... [2019-11-28 10:20:08,575 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2019-11-28 10:20:08,587 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 10:20:08,597 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 105 error locations. [2019-11-28 10:20:08,611 INFO L249 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2019-11-28 10:20:08,634 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 10:20:08,635 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 10:20:08,635 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 10:20:08,635 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 10:20:08,636 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 10:20:08,636 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 10:20:08,636 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 10:20:08,636 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 10:20:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states. [2019-11-28 10:20:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 10:20:08,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:08,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:08,678 INFO L410 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1848291795, now seen corresponding path program 1 times [2019-11-28 10:20:08,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:08,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086466997] [2019-11-28 10:20:08,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:08,860 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-28 10:20:08,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086466997] [2019-11-28 10:20:08,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:08,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 10:20:08,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641076867] [2019-11-28 10:20:08,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 10:20:08,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:08,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 10:20:08,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:20:08,890 INFO L87 Difference]: Start difference. First operand 279 states. Second operand 3 states. [2019-11-28 10:20:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:09,528 INFO L93 Difference]: Finished difference Result 319 states and 354 transitions. [2019-11-28 10:20:09,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 10:20:09,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 10:20:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:09,565 INFO L225 Difference]: With dead ends: 319 [2019-11-28 10:20:09,566 INFO L226 Difference]: Without dead ends: 315 [2019-11-28 10:20:09,571 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-28 10:20:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-28 10:20:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 277. [2019-11-28 10:20:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-28 10:20:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 303 transitions. [2019-11-28 10:20:09,694 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 303 transitions. Word has length 9 [2019-11-28 10:20:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:09,695 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 303 transitions. [2019-11-28 10:20:09,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 10:20:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 303 transitions. [2019-11-28 10:20:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 10:20:09,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:09,697 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:09,698 INFO L410 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:09,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:09,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1461424039, now seen corresponding path program 1 times [2019-11-28 10:20:09,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:09,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731849481] [2019-11-28 10:20:09,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:09,833 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-28 10:20:09,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731849481] [2019-11-28 10:20:09,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:09,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 10:20:09,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901704342] [2019-11-28 10:20:09,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 10:20:09,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:09,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 10:20:09,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 10:20:09,841 INFO L87 Difference]: Start difference. First operand 277 states and 303 transitions. Second operand 4 states. [2019-11-28 10:20:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:10,641 INFO L93 Difference]: Finished difference Result 332 states and 369 transitions. [2019-11-28 10:20:10,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 10:20:10,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 10:20:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:10,644 INFO L225 Difference]: With dead ends: 332 [2019-11-28 10:20:10,644 INFO L226 Difference]: Without dead ends: 332 [2019-11-28 10:20:10,645 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-28 10:20:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-28 10:20:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 275. [2019-11-28 10:20:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-28 10:20:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2019-11-28 10:20:10,672 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 10 [2019-11-28 10:20:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:10,677 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2019-11-28 10:20:10,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 10:20:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2019-11-28 10:20:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 10:20:10,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:10,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:10,680 INFO L410 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:10,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:10,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1461424040, now seen corresponding path program 1 times [2019-11-28 10:20:10,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:10,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092352215] [2019-11-28 10:20:10,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:10,800 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-28 10:20:10,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092352215] [2019-11-28 10:20:10,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:10,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 10:20:10,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379188795] [2019-11-28 10:20:10,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 10:20:10,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:10,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 10:20:10,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 10:20:10,803 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand 4 states. [2019-11-28 10:20:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:11,473 INFO L93 Difference]: Finished difference Result 341 states and 379 transitions. [2019-11-28 10:20:11,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 10:20:11,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 10:20:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:11,477 INFO L225 Difference]: With dead ends: 341 [2019-11-28 10:20:11,477 INFO L226 Difference]: Without dead ends: 341 [2019-11-28 10:20:11,479 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-28 10:20:11,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-28 10:20:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 273. [2019-11-28 10:20:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-28 10:20:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 299 transitions. [2019-11-28 10:20:11,491 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 299 transitions. Word has length 10 [2019-11-28 10:20:11,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:11,491 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 299 transitions. [2019-11-28 10:20:11,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 10:20:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 299 transitions. [2019-11-28 10:20:11,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 10:20:11,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:11,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:11,493 INFO L410 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:11,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:11,493 INFO L82 PathProgramCache]: Analyzing trace with hash 180424867, now seen corresponding path program 1 times [2019-11-28 10:20:11,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:11,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310589624] [2019-11-28 10:20:11,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:11,544 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-28 10:20:11,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310589624] [2019-11-28 10:20:11,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:11,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 10:20:11,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512426382] [2019-11-28 10:20:11,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 10:20:11,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 10:20:11,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 10:20:11,546 INFO L87 Difference]: Start difference. First operand 273 states and 299 transitions. Second operand 4 states. [2019-11-28 10:20:12,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:12,113 INFO L93 Difference]: Finished difference Result 308 states and 335 transitions. [2019-11-28 10:20:12,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:20:12,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 10:20:12,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:12,118 INFO L225 Difference]: With dead ends: 308 [2019-11-28 10:20:12,118 INFO L226 Difference]: Without dead ends: 307 [2019-11-28 10:20:12,119 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-28 10:20:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-28 10:20:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 272. [2019-11-28 10:20:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-28 10:20:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2019-11-28 10:20:12,132 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 14 [2019-11-28 10:20:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:12,133 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2019-11-28 10:20:12,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 10:20:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2019-11-28 10:20:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 10:20:12,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:12,134 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:12,135 INFO L410 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:12,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:12,136 INFO L82 PathProgramCache]: Analyzing trace with hash 438887496, now seen corresponding path program 1 times [2019-11-28 10:20:12,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:12,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096976841] [2019-11-28 10:20:12,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:20:12,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096976841] [2019-11-28 10:20:12,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:12,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 10:20:12,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232262271] [2019-11-28 10:20:12,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 10:20:12,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 10:20:12,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 10:20:12,233 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand 4 states. [2019-11-28 10:20:12,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:12,832 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2019-11-28 10:20:12,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 10:20:12,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 10:20:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:12,836 INFO L225 Difference]: With dead ends: 314 [2019-11-28 10:20:12,836 INFO L226 Difference]: Without dead ends: 314 [2019-11-28 10:20:12,836 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-28 10:20:12,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-28 10:20:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 270. [2019-11-28 10:20:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-28 10:20:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2019-11-28 10:20:12,845 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 15 [2019-11-28 10:20:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:12,845 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2019-11-28 10:20:12,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 10:20:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2019-11-28 10:20:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 10:20:12,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:12,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:20:12,847 INFO L410 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash 438887497, now seen corresponding path program 1 times [2019-11-28 10:20:12,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:12,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461536953] [2019-11-28 10:20:12,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:12,916 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-28 10:20:12,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461536953] [2019-11-28 10:20:12,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:12,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 10:20:12,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511534084] [2019-11-28 10:20:12,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 10:20:12,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:12,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 10:20:12,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 10:20:12,918 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand 4 states. [2019-11-28 10:20:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:13,497 INFO L93 Difference]: Finished difference Result 323 states and 355 transitions. [2019-11-28 10:20:13,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 10:20:13,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 10:20:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:13,500 INFO L225 Difference]: With dead ends: 323 [2019-11-28 10:20:13,500 INFO L226 Difference]: Without dead ends: 323 [2019-11-28 10:20:13,501 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-28 10:20:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-28 10:20:13,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 268. [2019-11-28 10:20:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-28 10:20:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2019-11-28 10:20:13,512 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 15 [2019-11-28 10:20:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:13,513 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2019-11-28 10:20:13,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 10:20:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2019-11-28 10:20:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 10:20:13,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:13,514 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-28 10:20:13,515 INFO L410 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:13,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:13,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1724277052, now seen corresponding path program 1 times [2019-11-28 10:20:13,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:13,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028810931] [2019-11-28 10:20:13,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:13,595 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-28 10:20:13,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028810931] [2019-11-28 10:20:13,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:13,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 10:20:13,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481868472] [2019-11-28 10:20:13,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:20:13,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:13,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:20:13,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:20:13,598 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand 5 states. [2019-11-28 10:20:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:14,332 INFO L93 Difference]: Finished difference Result 327 states and 359 transitions. [2019-11-28 10:20:14,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:20:14,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-28 10:20:14,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:14,335 INFO L225 Difference]: With dead ends: 327 [2019-11-28 10:20:14,335 INFO L226 Difference]: Without dead ends: 327 [2019-11-28 10:20:14,335 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-28 10:20:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-28 10:20:14,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-11-28 10:20:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-28 10:20:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 292 transitions. [2019-11-28 10:20:14,343 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 292 transitions. Word has length 21 [2019-11-28 10:20:14,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:14,344 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 292 transitions. [2019-11-28 10:20:14,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:20:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 292 transitions. [2019-11-28 10:20:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 10:20:14,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:14,345 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-28 10:20:14,345 INFO L410 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:14,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:14,346 INFO L82 PathProgramCache]: Analyzing trace with hash 410367502, now seen corresponding path program 1 times [2019-11-28 10:20:14,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:14,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60522121] [2019-11-28 10:20:14,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:14,410 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-28 10:20:14,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60522121] [2019-11-28 10:20:14,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:14,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 10:20:14,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959618354] [2019-11-28 10:20:14,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 10:20:14,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 10:20:14,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:20:14,413 INFO L87 Difference]: Start difference. First operand 268 states and 292 transitions. Second operand 7 states. [2019-11-28 10:20:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:15,255 INFO L93 Difference]: Finished difference Result 382 states and 420 transitions. [2019-11-28 10:20:15,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 10:20:15,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-28 10:20:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:15,260 INFO L225 Difference]: With dead ends: 382 [2019-11-28 10:20:15,260 INFO L226 Difference]: Without dead ends: 382 [2019-11-28 10:20:15,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-28 10:20:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-28 10:20:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 271. [2019-11-28 10:20:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-28 10:20:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2019-11-28 10:20:15,277 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 25 [2019-11-28 10:20:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:15,277 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2019-11-28 10:20:15,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 10:20:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2019-11-28 10:20:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 10:20:15,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:15,278 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-28 10:20:15,278 INFO L410 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:15,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:15,279 INFO L82 PathProgramCache]: Analyzing trace with hash 410353194, now seen corresponding path program 1 times [2019-11-28 10:20:15,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:15,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877755213] [2019-11-28 10:20:15,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:15,400 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-28 10:20:15,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877755213] [2019-11-28 10:20:15,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:15,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 10:20:15,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023343066] [2019-11-28 10:20:15,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 10:20:15,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:15,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 10:20:15,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:20:15,403 INFO L87 Difference]: Start difference. First operand 271 states and 297 transitions. Second operand 7 states. [2019-11-28 10:20:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:16,466 INFO L93 Difference]: Finished difference Result 310 states and 341 transitions. [2019-11-28 10:20:16,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 10:20:16,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-28 10:20:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:16,469 INFO L225 Difference]: With dead ends: 310 [2019-11-28 10:20:16,469 INFO L226 Difference]: Without dead ends: 310 [2019-11-28 10:20:16,470 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-28 10:20:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-28 10:20:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2019-11-28 10:20:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-28 10:20:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 289 transitions. [2019-11-28 10:20:16,486 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 289 transitions. Word has length 25 [2019-11-28 10:20:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:16,488 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 289 transitions. [2019-11-28 10:20:16,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 10:20:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 289 transitions. [2019-11-28 10:20:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 10:20:16,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:16,490 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-28 10:20:16,490 INFO L410 AbstractCegarLoop]: === Iteration 10 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:16,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:16,491 INFO L82 PathProgramCache]: Analyzing trace with hash 410353195, now seen corresponding path program 1 times [2019-11-28 10:20:16,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:16,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016618285] [2019-11-28 10:20:16,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:16,630 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-28 10:20:16,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016618285] [2019-11-28 10:20:16,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:16,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 10:20:16,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956156136] [2019-11-28 10:20:16,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 10:20:16,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:16,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 10:20:16,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:20:16,633 INFO L87 Difference]: Start difference. First operand 263 states and 289 transitions. Second operand 7 states. [2019-11-28 10:20:17,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:17,825 INFO L93 Difference]: Finished difference Result 351 states and 388 transitions. [2019-11-28 10:20:17,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 10:20:17,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-28 10:20:17,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:17,829 INFO L225 Difference]: With dead ends: 351 [2019-11-28 10:20:17,829 INFO L226 Difference]: Without dead ends: 351 [2019-11-28 10:20:17,830 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-28 10:20:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-28 10:20:17,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 288. [2019-11-28 10:20:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-28 10:20:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 321 transitions. [2019-11-28 10:20:17,838 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 321 transitions. Word has length 25 [2019-11-28 10:20:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:17,839 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 321 transitions. [2019-11-28 10:20:17,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 10:20:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 321 transitions. [2019-11-28 10:20:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 10:20:17,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:17,840 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] [2019-11-28 10:20:17,840 INFO L410 AbstractCegarLoop]: === Iteration 11 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:17,841 INFO L82 PathProgramCache]: Analyzing trace with hash -576712388, now seen corresponding path program 1 times [2019-11-28 10:20:17,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:17,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719094953] [2019-11-28 10:20:17,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:17,915 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-28 10:20:17,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719094953] [2019-11-28 10:20:17,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:17,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 10:20:17,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337615680] [2019-11-28 10:20:17,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 10:20:17,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:17,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 10:20:17,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 10:20:17,917 INFO L87 Difference]: Start difference. First operand 288 states and 321 transitions. Second operand 6 states. [2019-11-28 10:20:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:18,757 INFO L93 Difference]: Finished difference Result 307 states and 341 transitions. [2019-11-28 10:20:18,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:20:18,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-28 10:20:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:18,760 INFO L225 Difference]: With dead ends: 307 [2019-11-28 10:20:18,760 INFO L226 Difference]: Without dead ends: 307 [2019-11-28 10:20:18,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:20:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-28 10:20:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2019-11-28 10:20:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-28 10:20:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 318 transitions. [2019-11-28 10:20:18,770 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 318 transitions. Word has length 32 [2019-11-28 10:20:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:18,770 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 318 transitions. [2019-11-28 10:20:18,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 10:20:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 318 transitions. [2019-11-28 10:20:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 10:20:18,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:18,771 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] [2019-11-28 10:20:18,772 INFO L410 AbstractCegarLoop]: === Iteration 12 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:18,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:18,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1257129466, now seen corresponding path program 1 times [2019-11-28 10:20:18,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:18,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033044342] [2019-11-28 10:20:18,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:18,846 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-28 10:20:18,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033044342] [2019-11-28 10:20:18,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:18,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 10:20:18,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105696869] [2019-11-28 10:20:18,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 10:20:18,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:18,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 10:20:18,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 10:20:18,848 INFO L87 Difference]: Start difference. First operand 287 states and 318 transitions. Second operand 6 states. [2019-11-28 10:20:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:19,603 INFO L93 Difference]: Finished difference Result 306 states and 338 transitions. [2019-11-28 10:20:19,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:20:19,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-28 10:20:19,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:19,606 INFO L225 Difference]: With dead ends: 306 [2019-11-28 10:20:19,607 INFO L226 Difference]: Without dead ends: 306 [2019-11-28 10:20:19,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:20:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-28 10:20:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 286. [2019-11-28 10:20:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-28 10:20:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2019-11-28 10:20:19,616 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 32 [2019-11-28 10:20:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:19,616 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2019-11-28 10:20:19,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 10:20:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2019-11-28 10:20:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 10:20:19,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:19,617 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] [2019-11-28 10:20:19,618 INFO L410 AbstractCegarLoop]: === Iteration 13 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:19,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:19,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1283785288, now seen corresponding path program 1 times [2019-11-28 10:20:19,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:19,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311636148] [2019-11-28 10:20:19,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:19,723 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-28 10:20:19,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311636148] [2019-11-28 10:20:19,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:19,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 10:20:19,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032157533] [2019-11-28 10:20:19,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 10:20:19,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 10:20:19,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:20:19,725 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand 9 states. [2019-11-28 10:20:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:20,962 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2019-11-28 10:20:20,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:20:20,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-28 10:20:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:20,966 INFO L225 Difference]: With dead ends: 341 [2019-11-28 10:20:20,966 INFO L226 Difference]: Without dead ends: 341 [2019-11-28 10:20:20,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-28 10:20:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-28 10:20:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 286. [2019-11-28 10:20:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-28 10:20:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 314 transitions. [2019-11-28 10:20:20,975 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 314 transitions. Word has length 35 [2019-11-28 10:20:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:20,975 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 314 transitions. [2019-11-28 10:20:20,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 10:20:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 314 transitions. [2019-11-28 10:20:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 10:20:20,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:20,977 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] [2019-11-28 10:20:20,977 INFO L410 AbstractCegarLoop]: === Iteration 14 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:20,977 INFO L82 PathProgramCache]: Analyzing trace with hash 584864395, now seen corresponding path program 1 times [2019-11-28 10:20:20,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:20,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846538154] [2019-11-28 10:20:20,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:21,102 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-28 10:20:21,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846538154] [2019-11-28 10:20:21,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:21,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 10:20:21,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208990935] [2019-11-28 10:20:21,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 10:20:21,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:21,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 10:20:21,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:20:21,105 INFO L87 Difference]: Start difference. First operand 286 states and 314 transitions. Second operand 9 states. [2019-11-28 10:20:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:22,323 INFO L93 Difference]: Finished difference Result 340 states and 371 transitions. [2019-11-28 10:20:22,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:20:22,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-28 10:20:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:22,326 INFO L225 Difference]: With dead ends: 340 [2019-11-28 10:20:22,327 INFO L226 Difference]: Without dead ends: 340 [2019-11-28 10:20:22,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-28 10:20:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-28 10:20:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2019-11-28 10:20:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-28 10:20:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 313 transitions. [2019-11-28 10:20:22,336 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 313 transitions. Word has length 35 [2019-11-28 10:20:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:22,336 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 313 transitions. [2019-11-28 10:20:22,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 10:20:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 313 transitions. [2019-11-28 10:20:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 10:20:22,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:22,337 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-28 10:20:22,337 INFO L410 AbstractCegarLoop]: === Iteration 15 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:22,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:22,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1142948309, now seen corresponding path program 1 times [2019-11-28 10:20:22,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:22,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171949652] [2019-11-28 10:20:22,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:22,480 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-28 10:20:22,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171949652] [2019-11-28 10:20:22,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:22,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 10:20:22,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377226363] [2019-11-28 10:20:22,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 10:20:22,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:22,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 10:20:22,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 10:20:22,482 INFO L87 Difference]: Start difference. First operand 286 states and 313 transitions. Second operand 11 states. [2019-11-28 10:20:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:24,214 INFO L93 Difference]: Finished difference Result 354 states and 389 transitions. [2019-11-28 10:20:24,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 10:20:24,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-28 10:20:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:24,218 INFO L225 Difference]: With dead ends: 354 [2019-11-28 10:20:24,218 INFO L226 Difference]: Without dead ends: 354 [2019-11-28 10:20:24,219 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-28 10:20:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-28 10:20:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 287. [2019-11-28 10:20:24,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-28 10:20:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 315 transitions. [2019-11-28 10:20:24,227 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 315 transitions. Word has length 36 [2019-11-28 10:20:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:24,228 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 315 transitions. [2019-11-28 10:20:24,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 10:20:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 315 transitions. [2019-11-28 10:20:24,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 10:20:24,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:24,229 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-28 10:20:24,229 INFO L410 AbstractCegarLoop]: === Iteration 16 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:24,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1142948308, now seen corresponding path program 1 times [2019-11-28 10:20:24,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:24,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879019524] [2019-11-28 10:20:24,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:24,378 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-28 10:20:24,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879019524] [2019-11-28 10:20:24,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:24,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 10:20:24,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728328216] [2019-11-28 10:20:24,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 10:20:24,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:24,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 10:20:24,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:20:24,381 INFO L87 Difference]: Start difference. First operand 287 states and 315 transitions. Second operand 9 states. [2019-11-28 10:20:26,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:26,008 INFO L93 Difference]: Finished difference Result 338 states and 369 transitions. [2019-11-28 10:20:26,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:20:26,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-28 10:20:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:26,011 INFO L225 Difference]: With dead ends: 338 [2019-11-28 10:20:26,011 INFO L226 Difference]: Without dead ends: 338 [2019-11-28 10:20:26,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-28 10:20:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-28 10:20:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 287. [2019-11-28 10:20:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-28 10:20:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2019-11-28 10:20:26,020 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 36 [2019-11-28 10:20:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:26,021 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2019-11-28 10:20:26,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 10:20:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2019-11-28 10:20:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 10:20:26,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:26,022 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-28 10:20:26,022 INFO L410 AbstractCegarLoop]: === Iteration 17 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:26,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:26,022 INFO L82 PathProgramCache]: Analyzing trace with hash 950542285, now seen corresponding path program 1 times [2019-11-28 10:20:26,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:26,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806598154] [2019-11-28 10:20:26,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:26,208 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-28 10:20:26,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806598154] [2019-11-28 10:20:26,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:26,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 10:20:26,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652044737] [2019-11-28 10:20:26,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 10:20:26,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:26,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 10:20:26,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 10:20:26,211 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand 11 states. [2019-11-28 10:20:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:27,997 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2019-11-28 10:20:27,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 10:20:27,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-28 10:20:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:28,000 INFO L225 Difference]: With dead ends: 352 [2019-11-28 10:20:28,000 INFO L226 Difference]: Without dead ends: 352 [2019-11-28 10:20:28,001 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-28 10:20:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-28 10:20:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 287. [2019-11-28 10:20:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-28 10:20:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 313 transitions. [2019-11-28 10:20:28,012 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 313 transitions. Word has length 36 [2019-11-28 10:20:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:28,012 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 313 transitions. [2019-11-28 10:20:28,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 10:20:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 313 transitions. [2019-11-28 10:20:28,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 10:20:28,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:28,013 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-28 10:20:28,014 INFO L410 AbstractCegarLoop]: === Iteration 18 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:28,015 INFO L82 PathProgramCache]: Analyzing trace with hash 950542286, now seen corresponding path program 1 times [2019-11-28 10:20:28,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:28,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643024092] [2019-11-28 10:20:28,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:20:28,182 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-28 10:20:28,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643024092] [2019-11-28 10:20:28,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:20:28,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 10:20:28,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143310771] [2019-11-28 10:20:28,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 10:20:28,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:20:28,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 10:20:28,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:20:28,184 INFO L87 Difference]: Start difference. First operand 287 states and 313 transitions. Second operand 9 states. [2019-11-28 10:20:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:20:29,680 INFO L93 Difference]: Finished difference Result 336 states and 367 transitions. [2019-11-28 10:20:29,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:20:29,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-28 10:20:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:20:29,684 INFO L225 Difference]: With dead ends: 336 [2019-11-28 10:20:29,684 INFO L226 Difference]: Without dead ends: 336 [2019-11-28 10:20:29,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-28 10:20:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-28 10:20:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 287. [2019-11-28 10:20:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-28 10:20:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 312 transitions. [2019-11-28 10:20:29,692 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 312 transitions. Word has length 36 [2019-11-28 10:20:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:20:29,692 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 312 transitions. [2019-11-28 10:20:29,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 10:20:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 312 transitions. [2019-11-28 10:20:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 10:20:29,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:20:29,693 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] [2019-11-28 10:20:29,693 INFO L410 AbstractCegarLoop]: === Iteration 19 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, 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-28 10:20:29,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:20:29,694 INFO L82 PathProgramCache]: Analyzing trace with hash 927806725, now seen corresponding path program 1 times [2019-11-28 10:20:29,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:20:29,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916333333] [2019-11-28 10:20:29,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:20:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 10:20:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 10:20:29,753 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 10:20:29,754 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 10:20:29,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:20:29 BoogieIcfgContainer [2019-11-28 10:20:29,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 10:20:29,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 10:20:29,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 10:20:29,791 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 10:20:29,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:20:08" (3/4) ... [2019-11-28 10:20:29,794 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 10:20:29,849 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 10:20:29,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 10:20:29,858 INFO L168 Benchmark]: Toolchain (without parser) took 23191.32 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 455.6 MB). Free memory was 946.9 MB in the beginning and 1.4 GB in the end (delta: -422.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2019-11-28 10:20:29,859 INFO L168 Benchmark]: CDTParser took 0.18 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-28 10:20:29,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 10:20:29,860 INFO L168 Benchmark]: Boogie Preprocessor took 91.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:20:29,860 INFO L168 Benchmark]: RCFGBuilder took 1155.92 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: 96.0 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. [2019-11-28 10:20:29,863 INFO L168 Benchmark]: TraceAbstraction took 21225.17 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 300.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -340.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:20:29,863 INFO L168 Benchmark]: Witness Printer took 58.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:20:29,871 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.18 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 655.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1155.92 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: 96.0 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21225.17 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 300.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -340.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 58.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] struct list *data = ((void *)0); VAL [data={0:0}] [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L630] COND FALSE !(!node) VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L632] node->next = node VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L633] node->value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L634] struct list *item = malloc(sizeof *item); VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L635] COND FALSE !(!item) VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L637] item->slist = node VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L638] item->next = data VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L639] data = item VAL [data={-2:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) VAL [data={-2:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L643] CALL inspect_before(data) VAL [shape={-2:0}] [L604] COND FALSE !(!(shape)) VAL [shape={-2:0}, shape={-2:0}] [L605] shape->next VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) VAL [shape={-2:0}, shape={-2:0}] [L612] EXPR shape->next VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}] [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}] [L614] EXPR shape->slist->next VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L614] CALL fail() [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 285 locations, 105 error locations. Result: UNSAFE, OverallTime: 21.1s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3941 SDtfs, 5118 SDslu, 5522 SDs, 0 SdLazy, 15502 SolverSat, 622 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 56 SyntacticMatches, 9 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=10, 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, 18 MinimizatonAttempts, 958 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 85308 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 24/24 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 incorrect! Received shutdown request...