./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 6692e4fc 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 Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6692e4f [2019-11-25 17:58:29,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:58:29,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:58:29,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:58:29,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:58:29,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:58:29,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:58:29,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:58:29,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:58:29,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:58:29,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:58:29,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:58:29,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:58:29,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:58:29,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:58:29,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:58:29,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:58:29,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:58:29,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:58:29,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:58:29,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:58:29,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:58:29,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:58:29,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:58:29,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:58:29,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:58:29,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:58:29,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:58:29,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:58:29,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:58:29,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:58:29,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:58:29,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:58:29,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:58:29,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:58:29,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:58:29,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:58:29,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:58:29,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:58:29,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:58:29,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:58:29,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-25 17:58:29,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:58:29,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:58:29,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:58:29,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:58:29,656 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:58:29,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:58:29,656 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 17:58:29,657 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:58:29,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:58:29,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 17:58:29,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:58:29,657 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:58:29,658 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:58:29,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:58:29,660 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:58:29,660 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 17:58:29,660 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:58:29,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:58:29,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:58:29,661 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:58:29,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:58:29,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:58:29,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:58:29,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:58:29,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:58:29,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:58:29,667 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-25 17:58:30,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:58:30,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:58:30,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:58:30,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:58:30,038 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:58:30,039 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-25 17:58:30,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9ae55b5/4718126577ee4977b5cb7b702841e680/FLAG67969ed46 [2019-11-25 17:58:30,623 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:58:30,623 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-25 17:58:30,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9ae55b5/4718126577ee4977b5cb7b702841e680/FLAG67969ed46 [2019-11-25 17:58:30,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9ae55b5/4718126577ee4977b5cb7b702841e680 [2019-11-25 17:58:30,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:58:30,918 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:58:30,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:58:30,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:58:30,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:58:30,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:30" (1/1) ... [2019-11-25 17:58:30,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d0c63d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:30, skipping insertion in model container [2019-11-25 17:58:30,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:30" (1/1) ... [2019-11-25 17:58:30,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:58:30,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:58:31,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:58:31,404 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:58:31,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:58:31,521 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:58:31,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:31 WrapperNode [2019-11-25 17:58:31,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:58:31,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:58:31,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:58:31,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:58:31,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:31" (1/1) ... [2019-11-25 17:58:31,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:31" (1/1) ... [2019-11-25 17:58:31,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:31" (1/1) ... [2019-11-25 17:58:31,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:31" (1/1) ... [2019-11-25 17:58:31,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:31" (1/1) ... [2019-11-25 17:58:31,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:31" (1/1) ... [2019-11-25 17:58:31,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:31" (1/1) ... [2019-11-25 17:58:31,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:58:31,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:58:31,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:58:31,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:58:31,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:31" (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-25 17:58:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:58:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:58:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 17:58:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 17:58:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-11-25 17:58:31,704 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-11-25 17:58:31,704 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-11-25 17:58:31,704 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-11-25 17:58:31,704 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-11-25 17:58:31,704 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-11-25 17:58:31,705 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:58:31,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 17:58:31,705 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 17:58:31,705 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 17:58:31,705 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 17:58:31,705 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 17:58:31,705 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 17:58:31,706 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 17:58:31,706 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 17:58:31,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 17:58:31,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 17:58:31,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 17:58:31,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 17:58:31,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 17:58:31,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 17:58:31,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 17:58:31,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 17:58:31,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 17:58:31,708 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 17:58:31,708 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 17:58:31,708 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 17:58:31,708 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 17:58:31,708 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 17:58:31,709 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 17:58:31,709 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 17:58:31,709 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 17:58:31,709 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 17:58:31,709 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 17:58:31,710 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 17:58:31,710 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 17:58:31,710 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 17:58:31,710 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 17:58:31,710 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 17:58:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 17:58:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 17:58:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 17:58:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 17:58:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 17:58:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 17:58:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 17:58:31,712 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 17:58:31,712 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 17:58:31,712 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 17:58:31,712 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 17:58:31,712 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 17:58:31,712 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 17:58:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 17:58:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 17:58:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 17:58:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 17:58:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 17:58:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 17:58:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 17:58:31,714 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 17:58:31,714 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 17:58:31,714 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:58:31,714 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 17:58:31,714 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:58:31,714 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-25 17:58:31,714 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 17:58:31,715 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 17:58:31,715 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 17:58:31,715 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 17:58:31,715 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 17:58:31,715 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 17:58:31,715 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 17:58:31,716 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 17:58:31,716 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 17:58:31,716 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 17:58:31,716 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 17:58:31,716 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 17:58:31,716 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 17:58:31,716 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 17:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 17:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 17:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 17:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 17:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 17:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 17:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 17:58:31,718 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 17:58:31,718 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 17:58:31,718 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 17:58:31,718 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 17:58:31,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 17:58:31,718 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 17:58:31,719 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 17:58:31,719 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 17:58:31,719 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 17:58:31,719 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 17:58:31,719 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 17:58:31,719 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 17:58:31,719 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 17:58:31,719 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 17:58:31,719 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 17:58:31,720 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 17:58:31,720 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 17:58:31,720 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 17:58:31,720 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 17:58:31,720 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 17:58:31,720 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 17:58:31,720 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 17:58:31,720 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 17:58:31,720 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 17:58:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:58:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-11-25 17:58:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-11-25 17:58:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 17:58:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 17:58:31,724 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-11-25 17:58:31,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 17:58:31,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 17:58:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:58:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-11-25 17:58:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-11-25 17:58:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-11-25 17:58:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:58:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:58:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 17:58:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:58:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:58:32,801 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:58:32,802 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-11-25 17:58:32,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:32 BoogieIcfgContainer [2019-11-25 17:58:32,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:58:32,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:58:32,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:58:32,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:58:32,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:58:30" (1/3) ... [2019-11-25 17:58:32,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ead9e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:58:32, skipping insertion in model container [2019-11-25 17:58:32,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:31" (2/3) ... [2019-11-25 17:58:32,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ead9e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:58:32, skipping insertion in model container [2019-11-25 17:58:32,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:32" (3/3) ... [2019-11-25 17:58:32,813 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2019-11-25 17:58:32,823 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:58:32,831 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 104 error locations. [2019-11-25 17:58:32,843 INFO L249 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2019-11-25 17:58:32,864 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:58:32,865 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:58:32,865 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:58:32,865 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:58:32,867 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:58:32,867 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:58:32,867 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:58:32,867 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:58:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states. [2019-11-25 17:58:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 17:58:32,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:32,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:32,911 INFO L410 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:32,917 INFO L82 PathProgramCache]: Analyzing trace with hash 995848786, now seen corresponding path program 1 times [2019-11-25 17:58:32,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:32,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949309724] [2019-11-25 17:58:32,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:33,078 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-25 17:58:33,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949309724] [2019-11-25 17:58:33,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:33,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 17:58:33,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175033050] [2019-11-25 17:58:33,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 17:58:33,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:33,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 17:58:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:58:33,107 INFO L87 Difference]: Start difference. First operand 278 states. Second operand 3 states. [2019-11-25 17:58:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:33,691 INFO L93 Difference]: Finished difference Result 318 states and 353 transitions. [2019-11-25 17:58:33,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 17:58:33,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-25 17:58:33,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:33,709 INFO L225 Difference]: With dead ends: 318 [2019-11-25 17:58:33,709 INFO L226 Difference]: Without dead ends: 300 [2019-11-25 17:58:33,711 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-25 17:58:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-25 17:58:33,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 262. [2019-11-25 17:58:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-25 17:58:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 276 transitions. [2019-11-25 17:58:33,810 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 276 transitions. Word has length 9 [2019-11-25 17:58:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:33,810 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 276 transitions. [2019-11-25 17:58:33,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 17:58:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 276 transitions. [2019-11-25 17:58:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 17:58:33,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:33,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:33,812 INFO L410 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:33,812 INFO L82 PathProgramCache]: Analyzing trace with hash 805494535, now seen corresponding path program 1 times [2019-11-25 17:58:33,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:33,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757939177] [2019-11-25 17:58:33,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:33,898 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-25 17:58:33,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757939177] [2019-11-25 17:58:33,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:33,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 17:58:33,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088049509] [2019-11-25 17:58:33,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:58:33,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:33,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:58:33,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:58:33,902 INFO L87 Difference]: Start difference. First operand 262 states and 276 transitions. Second operand 4 states. [2019-11-25 17:58:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:34,579 INFO L93 Difference]: Finished difference Result 317 states and 342 transitions. [2019-11-25 17:58:34,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 17:58:34,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-25 17:58:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:34,582 INFO L225 Difference]: With dead ends: 317 [2019-11-25 17:58:34,583 INFO L226 Difference]: Without dead ends: 317 [2019-11-25 17:58:34,584 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-25 17:58:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-25 17:58:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 260. [2019-11-25 17:58:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-25 17:58:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 274 transitions. [2019-11-25 17:58:34,601 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 274 transitions. Word has length 10 [2019-11-25 17:58:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:34,602 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 274 transitions. [2019-11-25 17:58:34,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:58:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 274 transitions. [2019-11-25 17:58:34,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 17:58:34,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:34,603 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:34,603 INFO L410 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:34,604 INFO L82 PathProgramCache]: Analyzing trace with hash 805494536, now seen corresponding path program 1 times [2019-11-25 17:58:34,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:34,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713311131] [2019-11-25 17:58:34,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:34,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713311131] [2019-11-25 17:58:34,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:34,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 17:58:34,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566853298] [2019-11-25 17:58:34,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:58:34,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:34,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:58:34,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:58:34,681 INFO L87 Difference]: Start difference. First operand 260 states and 274 transitions. Second operand 4 states. [2019-11-25 17:58:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:35,327 INFO L93 Difference]: Finished difference Result 326 states and 352 transitions. [2019-11-25 17:58:35,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 17:58:35,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-25 17:58:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:35,331 INFO L225 Difference]: With dead ends: 326 [2019-11-25 17:58:35,331 INFO L226 Difference]: Without dead ends: 326 [2019-11-25 17:58:35,332 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-25 17:58:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-25 17:58:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 258. [2019-11-25 17:58:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-25 17:58:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 272 transitions. [2019-11-25 17:58:35,346 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 272 transitions. Word has length 10 [2019-11-25 17:58:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:35,346 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 272 transitions. [2019-11-25 17:58:35,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:58:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 272 transitions. [2019-11-25 17:58:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 17:58:35,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:35,347 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:35,348 INFO L410 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:35,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:35,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1991342111, now seen corresponding path program 1 times [2019-11-25 17:58:35,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:35,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928087917] [2019-11-25 17:58:35,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:35,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928087917] [2019-11-25 17:58:35,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:35,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 17:58:35,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701611889] [2019-11-25 17:58:35,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:58:35,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:58:35,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:58:35,398 INFO L87 Difference]: Start difference. First operand 258 states and 272 transitions. Second operand 4 states. [2019-11-25 17:58:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:35,918 INFO L93 Difference]: Finished difference Result 293 states and 308 transitions. [2019-11-25 17:58:35,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:58:35,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-25 17:58:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:35,922 INFO L225 Difference]: With dead ends: 293 [2019-11-25 17:58:35,922 INFO L226 Difference]: Without dead ends: 292 [2019-11-25 17:58:35,923 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-25 17:58:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-25 17:58:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 257. [2019-11-25 17:58:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-25 17:58:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 270 transitions. [2019-11-25 17:58:35,933 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 270 transitions. Word has length 14 [2019-11-25 17:58:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:35,933 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 270 transitions. [2019-11-25 17:58:35,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:58:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 270 transitions. [2019-11-25 17:58:35,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 17:58:35,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:35,934 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:35,935 INFO L410 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:35,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:35,935 INFO L82 PathProgramCache]: Analyzing trace with hash 742236455, now seen corresponding path program 1 times [2019-11-25 17:58:35,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:35,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607637278] [2019-11-25 17:58:35,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:36,011 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-25 17:58:36,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607637278] [2019-11-25 17:58:36,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:36,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 17:58:36,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390173556] [2019-11-25 17:58:36,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:58:36,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:36,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:58:36,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:58:36,019 INFO L87 Difference]: Start difference. First operand 257 states and 270 transitions. Second operand 4 states. [2019-11-25 17:58:36,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:36,544 INFO L93 Difference]: Finished difference Result 299 states and 318 transitions. [2019-11-25 17:58:36,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 17:58:36,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-25 17:58:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:36,548 INFO L225 Difference]: With dead ends: 299 [2019-11-25 17:58:36,548 INFO L226 Difference]: Without dead ends: 299 [2019-11-25 17:58:36,548 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-25 17:58:36,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-25 17:58:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2019-11-25 17:58:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-25 17:58:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 268 transitions. [2019-11-25 17:58:36,557 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 268 transitions. Word has length 15 [2019-11-25 17:58:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:36,558 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 268 transitions. [2019-11-25 17:58:36,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:58:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 268 transitions. [2019-11-25 17:58:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 17:58:36,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:36,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:36,559 INFO L410 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:36,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:36,560 INFO L82 PathProgramCache]: Analyzing trace with hash 742236456, now seen corresponding path program 1 times [2019-11-25 17:58:36,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:36,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028927791] [2019-11-25 17:58:36,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:36,624 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-25 17:58:36,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028927791] [2019-11-25 17:58:36,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:36,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 17:58:36,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116197779] [2019-11-25 17:58:36,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:58:36,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:36,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:58:36,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:58:36,627 INFO L87 Difference]: Start difference. First operand 255 states and 268 transitions. Second operand 4 states. [2019-11-25 17:58:37,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:37,124 INFO L93 Difference]: Finished difference Result 308 states and 328 transitions. [2019-11-25 17:58:37,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 17:58:37,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-25 17:58:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:37,128 INFO L225 Difference]: With dead ends: 308 [2019-11-25 17:58:37,128 INFO L226 Difference]: Without dead ends: 308 [2019-11-25 17:58:37,129 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-25 17:58:37,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-25 17:58:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 253. [2019-11-25 17:58:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-25 17:58:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2019-11-25 17:58:37,140 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 15 [2019-11-25 17:58:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:37,141 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2019-11-25 17:58:37,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:58:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2019-11-25 17:58:37,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 17:58:37,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:37,143 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-25 17:58:37,143 INFO L410 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:37,144 INFO L82 PathProgramCache]: Analyzing trace with hash -224686077, now seen corresponding path program 1 times [2019-11-25 17:58:37,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:37,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107846175] [2019-11-25 17:58:37,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:37,240 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-25 17:58:37,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107846175] [2019-11-25 17:58:37,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:37,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:58:37,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768593023] [2019-11-25 17:58:37,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:58:37,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:37,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:58:37,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:58:37,245 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand 5 states. [2019-11-25 17:58:37,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:37,913 INFO L93 Difference]: Finished difference Result 312 states and 332 transitions. [2019-11-25 17:58:37,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:58:37,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-25 17:58:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:37,917 INFO L225 Difference]: With dead ends: 312 [2019-11-25 17:58:37,917 INFO L226 Difference]: Without dead ends: 312 [2019-11-25 17:58:37,917 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-25 17:58:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-25 17:58:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 253. [2019-11-25 17:58:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-25 17:58:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions. [2019-11-25 17:58:37,928 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 21 [2019-11-25 17:58:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:37,929 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions. [2019-11-25 17:58:37,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:58:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions. [2019-11-25 17:58:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 17:58:37,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:37,930 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-25 17:58:37,931 INFO L410 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:37,932 INFO L82 PathProgramCache]: Analyzing trace with hash 552515561, now seen corresponding path program 1 times [2019-11-25 17:58:37,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:37,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841608741] [2019-11-25 17:58:37,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:38,051 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-25 17:58:38,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841608741] [2019-11-25 17:58:38,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:38,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:58:38,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959866038] [2019-11-25 17:58:38,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:58:38,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:38,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:58:38,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:58:38,053 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand 7 states. [2019-11-25 17:58:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:38,867 INFO L93 Difference]: Finished difference Result 293 states and 312 transitions. [2019-11-25 17:58:38,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:58:38,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-25 17:58:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:38,871 INFO L225 Difference]: With dead ends: 293 [2019-11-25 17:58:38,871 INFO L226 Difference]: Without dead ends: 293 [2019-11-25 17:58:38,871 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-25 17:58:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-25 17:58:38,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 246. [2019-11-25 17:58:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-25 17:58:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 260 transitions. [2019-11-25 17:58:38,879 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 260 transitions. Word has length 25 [2019-11-25 17:58:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:38,879 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 260 transitions. [2019-11-25 17:58:38,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:58:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 260 transitions. [2019-11-25 17:58:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 17:58:38,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:38,880 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-25 17:58:38,881 INFO L410 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:38,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash 552515562, now seen corresponding path program 1 times [2019-11-25 17:58:38,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:38,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486084777] [2019-11-25 17:58:38,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:38,978 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-25 17:58:38,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486084777] [2019-11-25 17:58:38,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:38,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:58:38,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145311555] [2019-11-25 17:58:38,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:58:38,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:38,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:58:38,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:58:38,980 INFO L87 Difference]: Start difference. First operand 246 states and 260 transitions. Second operand 7 states. [2019-11-25 17:58:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:39,947 INFO L93 Difference]: Finished difference Result 331 states and 351 transitions. [2019-11-25 17:58:39,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:58:39,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-25 17:58:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:39,950 INFO L225 Difference]: With dead ends: 331 [2019-11-25 17:58:39,950 INFO L226 Difference]: Without dead ends: 331 [2019-11-25 17:58:39,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:58:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-25 17:58:39,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 274. [2019-11-25 17:58:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-25 17:58:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 291 transitions. [2019-11-25 17:58:39,959 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 291 transitions. Word has length 25 [2019-11-25 17:58:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:39,959 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 291 transitions. [2019-11-25 17:58:39,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:58:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 291 transitions. [2019-11-25 17:58:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 17:58:39,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:39,961 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-25 17:58:39,961 INFO L410 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:39,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:39,961 INFO L82 PathProgramCache]: Analyzing trace with hash 690194188, now seen corresponding path program 1 times [2019-11-25 17:58:39,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:39,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844173753] [2019-11-25 17:58:39,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:40,169 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-25 17:58:40,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844173753] [2019-11-25 17:58:40,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:40,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 17:58:40,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295326979] [2019-11-25 17:58:40,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 17:58:40,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:40,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 17:58:40,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:58:40,172 INFO L87 Difference]: Start difference. First operand 274 states and 291 transitions. Second operand 11 states. [2019-11-25 17:58:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:41,783 INFO L93 Difference]: Finished difference Result 340 states and 364 transitions. [2019-11-25 17:58:41,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:58:41,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-25 17:58:41,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:41,785 INFO L225 Difference]: With dead ends: 340 [2019-11-25 17:58:41,785 INFO L226 Difference]: Without dead ends: 340 [2019-11-25 17:58:41,786 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-25 17:58:41,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-25 17:58:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 275. [2019-11-25 17:58:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-25 17:58:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 293 transitions. [2019-11-25 17:58:41,793 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 293 transitions. Word has length 36 [2019-11-25 17:58:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:41,793 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 293 transitions. [2019-11-25 17:58:41,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 17:58:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 293 transitions. [2019-11-25 17:58:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 17:58:41,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:41,795 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-25 17:58:41,796 INFO L410 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:41,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:41,796 INFO L82 PathProgramCache]: Analyzing trace with hash 690194189, now seen corresponding path program 1 times [2019-11-25 17:58:41,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:41,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530717614] [2019-11-25 17:58:41,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:41,941 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-25 17:58:41,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530717614] [2019-11-25 17:58:41,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:41,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 17:58:41,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300594412] [2019-11-25 17:58:41,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 17:58:41,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:41,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 17:58:41,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:58:41,943 INFO L87 Difference]: Start difference. First operand 275 states and 293 transitions. Second operand 9 states. [2019-11-25 17:58:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:43,319 INFO L93 Difference]: Finished difference Result 324 states and 344 transitions. [2019-11-25 17:58:43,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:58:43,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-25 17:58:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:43,323 INFO L225 Difference]: With dead ends: 324 [2019-11-25 17:58:43,323 INFO L226 Difference]: Without dead ends: 324 [2019-11-25 17:58:43,324 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-25 17:58:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-25 17:58:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 275. [2019-11-25 17:58:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-25 17:58:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 292 transitions. [2019-11-25 17:58:43,332 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 292 transitions. Word has length 36 [2019-11-25 17:58:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:43,332 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 292 transitions. [2019-11-25 17:58:43,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 17:58:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 292 transitions. [2019-11-25 17:58:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 17:58:43,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:43,333 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-25 17:58:43,334 INFO L410 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:43,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:43,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1511282514, now seen corresponding path program 1 times [2019-11-25 17:58:43,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:43,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175048744] [2019-11-25 17:58:43,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:43,481 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-25 17:58:43,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175048744] [2019-11-25 17:58:43,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:43,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 17:58:43,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139228706] [2019-11-25 17:58:43,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 17:58:43,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:43,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 17:58:43,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:58:43,483 INFO L87 Difference]: Start difference. First operand 275 states and 292 transitions. Second operand 11 states. [2019-11-25 17:58:45,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:45,089 INFO L93 Difference]: Finished difference Result 338 states and 362 transitions. [2019-11-25 17:58:45,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:58:45,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-25 17:58:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:45,091 INFO L225 Difference]: With dead ends: 338 [2019-11-25 17:58:45,092 INFO L226 Difference]: Without dead ends: 338 [2019-11-25 17:58:45,092 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-25 17:58:45,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-25 17:58:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 275. [2019-11-25 17:58:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-25 17:58:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 291 transitions. [2019-11-25 17:58:45,101 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 291 transitions. Word has length 36 [2019-11-25 17:58:45,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:45,101 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 291 transitions. [2019-11-25 17:58:45,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 17:58:45,101 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 291 transitions. [2019-11-25 17:58:45,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 17:58:45,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:45,102 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-25 17:58:45,103 INFO L410 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:45,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:45,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1511282513, now seen corresponding path program 1 times [2019-11-25 17:58:45,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:45,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687547836] [2019-11-25 17:58:45,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:45,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687547836] [2019-11-25 17:58:45,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:45,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 17:58:45,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986627544] [2019-11-25 17:58:45,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 17:58:45,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:45,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 17:58:45,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:58:45,255 INFO L87 Difference]: Start difference. First operand 275 states and 291 transitions. Second operand 9 states. [2019-11-25 17:58:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:46,588 INFO L93 Difference]: Finished difference Result 322 states and 342 transitions. [2019-11-25 17:58:46,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:58:46,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-25 17:58:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:46,590 INFO L225 Difference]: With dead ends: 322 [2019-11-25 17:58:46,590 INFO L226 Difference]: Without dead ends: 322 [2019-11-25 17:58:46,591 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-25 17:58:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-25 17:58:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 275. [2019-11-25 17:58:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-25 17:58:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 290 transitions. [2019-11-25 17:58:46,600 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 290 transitions. Word has length 36 [2019-11-25 17:58:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:46,601 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 290 transitions. [2019-11-25 17:58:46,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 17:58:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 290 transitions. [2019-11-25 17:58:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-25 17:58:46,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:46,602 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:46,602 INFO L410 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:46,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:46,603 INFO L82 PathProgramCache]: Analyzing trace with hash 801871937, now seen corresponding path program 1 times [2019-11-25 17:58:46,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:46,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123744479] [2019-11-25 17:58:46,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:46,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123744479] [2019-11-25 17:58:46,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:46,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-25 17:58:46,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107832194] [2019-11-25 17:58:46,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 17:58:46,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:46,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 17:58:46,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:58:46,777 INFO L87 Difference]: Start difference. First operand 275 states and 290 transitions. Second operand 13 states. [2019-11-25 17:58:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:48,512 INFO L93 Difference]: Finished difference Result 276 states and 294 transitions. [2019-11-25 17:58:48,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 17:58:48,512 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2019-11-25 17:58:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:48,515 INFO L225 Difference]: With dead ends: 276 [2019-11-25 17:58:48,515 INFO L226 Difference]: Without dead ends: 265 [2019-11-25 17:58:48,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2019-11-25 17:58:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-11-25 17:58:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 223. [2019-11-25 17:58:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-25 17:58:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 236 transitions. [2019-11-25 17:58:48,522 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 236 transitions. Word has length 41 [2019-11-25 17:58:48,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:48,523 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 236 transitions. [2019-11-25 17:58:48,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 17:58:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 236 transitions. [2019-11-25 17:58:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 17:58:48,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:48,524 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:48,524 INFO L410 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:48,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:48,524 INFO L82 PathProgramCache]: Analyzing trace with hash 257285329, now seen corresponding path program 1 times [2019-11-25 17:58:48,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:48,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257811642] [2019-11-25 17:58:48,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:48,607 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-25 17:58:48,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257811642] [2019-11-25 17:58:48,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:48,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:58:48,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257573990] [2019-11-25 17:58:48,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:58:48,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:48,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:58:48,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:58:48,609 INFO L87 Difference]: Start difference. First operand 223 states and 236 transitions. Second operand 7 states. [2019-11-25 17:58:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:49,443 INFO L93 Difference]: Finished difference Result 266 states and 287 transitions. [2019-11-25 17:58:49,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:58:49,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-11-25 17:58:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:49,445 INFO L225 Difference]: With dead ends: 266 [2019-11-25 17:58:49,445 INFO L226 Difference]: Without dead ends: 266 [2019-11-25 17:58:49,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:58:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-25 17:58:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 223. [2019-11-25 17:58:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-25 17:58:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2019-11-25 17:58:49,453 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 46 [2019-11-25 17:58:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:49,453 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2019-11-25 17:58:49,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:58:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2019-11-25 17:58:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 17:58:49,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:49,454 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:49,455 INFO L410 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:49,455 INFO L82 PathProgramCache]: Analyzing trace with hash 257285330, now seen corresponding path program 1 times [2019-11-25 17:58:49,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:49,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907165795] [2019-11-25 17:58:49,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:49,554 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-25 17:58:49,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907165795] [2019-11-25 17:58:49,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:49,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:58:49,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224817239] [2019-11-25 17:58:49,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:58:49,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:49,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:58:49,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:58:49,556 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 7 states. [2019-11-25 17:58:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:50,598 INFO L93 Difference]: Finished difference Result 281 states and 301 transitions. [2019-11-25 17:58:50,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:58:50,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-11-25 17:58:50,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:50,601 INFO L225 Difference]: With dead ends: 281 [2019-11-25 17:58:50,601 INFO L226 Difference]: Without dead ends: 281 [2019-11-25 17:58:50,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:58:50,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-25 17:58:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 242. [2019-11-25 17:58:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-25 17:58:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 262 transitions. [2019-11-25 17:58:50,608 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 262 transitions. Word has length 46 [2019-11-25 17:58:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:50,609 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 262 transitions. [2019-11-25 17:58:50,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:58:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 262 transitions. [2019-11-25 17:58:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-25 17:58:50,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:50,610 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:50,610 INFO L410 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:50,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:50,610 INFO L82 PathProgramCache]: Analyzing trace with hash -679135460, now seen corresponding path program 1 times [2019-11-25 17:58:50,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:50,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345524189] [2019-11-25 17:58:50,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:50,668 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-25 17:58:50,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345524189] [2019-11-25 17:58:50,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:50,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:58:50,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599134516] [2019-11-25 17:58:50,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:58:50,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:58:50,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:58:50,670 INFO L87 Difference]: Start difference. First operand 242 states and 262 transitions. Second operand 6 states. [2019-11-25 17:58:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:51,230 INFO L93 Difference]: Finished difference Result 248 states and 267 transitions. [2019-11-25 17:58:51,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:58:51,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-25 17:58:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:51,234 INFO L225 Difference]: With dead ends: 248 [2019-11-25 17:58:51,234 INFO L226 Difference]: Without dead ends: 248 [2019-11-25 17:58:51,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:58:51,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-25 17:58:51,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 239. [2019-11-25 17:58:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-25 17:58:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 259 transitions. [2019-11-25 17:58:51,241 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 259 transitions. Word has length 47 [2019-11-25 17:58:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:51,241 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 259 transitions. [2019-11-25 17:58:51,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:58:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 259 transitions. [2019-11-25 17:58:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-25 17:58:51,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:51,242 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:51,242 INFO L410 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:51,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:51,242 INFO L82 PathProgramCache]: Analyzing trace with hash -679135459, now seen corresponding path program 1 times [2019-11-25 17:58:51,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:51,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659292286] [2019-11-25 17:58:51,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:51,338 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-25 17:58:51,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659292286] [2019-11-25 17:58:51,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:51,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:58:51,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34059072] [2019-11-25 17:58:51,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:58:51,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:51,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:58:51,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:58:51,340 INFO L87 Difference]: Start difference. First operand 239 states and 259 transitions. Second operand 7 states. [2019-11-25 17:58:52,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:52,140 INFO L93 Difference]: Finished difference Result 300 states and 319 transitions. [2019-11-25 17:58:52,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:58:52,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-25 17:58:52,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:52,148 INFO L225 Difference]: With dead ends: 300 [2019-11-25 17:58:52,148 INFO L226 Difference]: Without dead ends: 300 [2019-11-25 17:58:52,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:58:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-25 17:58:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 260. [2019-11-25 17:58:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-25 17:58:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 286 transitions. [2019-11-25 17:58:52,159 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 286 transitions. Word has length 47 [2019-11-25 17:58:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:52,159 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 286 transitions. [2019-11-25 17:58:52,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:58:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 286 transitions. [2019-11-25 17:58:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 17:58:52,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:52,163 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:52,164 INFO L410 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:52,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:52,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2077484617, now seen corresponding path program 1 times [2019-11-25 17:58:52,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:52,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313364355] [2019-11-25 17:58:52,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:52,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313364355] [2019-11-25 17:58:52,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:52,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 17:58:52,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621911128] [2019-11-25 17:58:52,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:58:52,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:52,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:58:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:58:52,289 INFO L87 Difference]: Start difference. First operand 260 states and 286 transitions. Second operand 8 states. [2019-11-25 17:58:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:53,191 INFO L93 Difference]: Finished difference Result 310 states and 334 transitions. [2019-11-25 17:58:53,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:58:53,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-25 17:58:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:53,193 INFO L225 Difference]: With dead ends: 310 [2019-11-25 17:58:53,193 INFO L226 Difference]: Without dead ends: 307 [2019-11-25 17:58:53,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:58:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-25 17:58:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-11-25 17:58:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-25 17:58:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2019-11-25 17:58:53,200 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 50 [2019-11-25 17:58:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:53,201 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2019-11-25 17:58:53,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:58:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2019-11-25 17:58:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 17:58:53,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:53,202 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:53,202 INFO L410 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-25 17:58:53,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2056453987, now seen corresponding path program 1 times [2019-11-25 17:58:53,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:53,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352368138] [2019-11-25 17:58:53,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:53,406 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-25 17:58:53,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352368138] [2019-11-25 17:58:53,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:53,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-25 17:58:53,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001402971] [2019-11-25 17:58:53,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 17:58:53,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:53,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 17:58:53,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:58:53,408 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand 13 states. [2019-11-25 17:58:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:53,929 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-11-25 17:58:53,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 17:58:53,929 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-11-25 17:58:53,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:53,930 INFO L225 Difference]: With dead ends: 44 [2019-11-25 17:58:53,930 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 17:58:53,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-11-25 17:58:53,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 17:58:53,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 17:58:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 17:58:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 17:58:53,932 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-11-25 17:58:53,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:53,932 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 17:58:53,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 17:58:53,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 17:58:53,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 17:58:53,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:58:53 BoogieIcfgContainer [2019-11-25 17:58:53,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 17:58:53,940 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 17:58:53,940 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 17:58:53,940 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 17:58:53,941 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:32" (3/4) ... [2019-11-25 17:58:53,944 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 17:58:53,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fail [2019-11-25 17:58:53,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 17:58:53,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_pair [2019-11-25 17:58:53,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_single_node [2019-11-25 17:58:53,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-25 17:58:53,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure seq_sort_core [2019-11-25 17:58:53,953 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-25 17:58:53,953 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_before [2019-11-25 17:58:53,953 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 17:58:53,953 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_after [2019-11-25 17:58:53,963 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-11-25 17:58:53,963 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-25 17:58:53,964 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 17:58:53,964 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:58:54,045 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 17:58:54,045 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 17:58:54,047 INFO L168 Benchmark]: Toolchain (without parser) took 23129.05 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 482.3 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -371.5 MB). Peak memory consumption was 110.9 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:54,048 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:58:54,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 602.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:54,048 INFO L168 Benchmark]: Boogie Preprocessor took 115.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:54,049 INFO L168 Benchmark]: RCFGBuilder took 1166.14 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.3 MB). Peak memory consumption was 96.3 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:54,049 INFO L168 Benchmark]: TraceAbstraction took 21134.79 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 339.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -311.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:54,049 INFO L168 Benchmark]: Witness Printer took 105.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:58:54,051 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 602.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 115.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1166.14 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.3 MB). Peak memory consumption was 96.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21134.79 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 339.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -311.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Witness Printer took 105.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 644]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 644]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 104 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 284 locations, 104 error locations. Result: SAFE, OverallTime: 21.0s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3613 SDtfs, 4687 SDslu, 5481 SDs, 0 SdLazy, 16049 SolverSat, 472 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 904 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 615 NumberOfCodeBlocks, 615 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 129379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 30/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...