./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 5758efa3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 534681b11e8e68e6058985d885b01f2cbfa43e5b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.24-5758efa [2019-11-26 21:37:31,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 21:37:31,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 21:37:31,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 21:37:31,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 21:37:31,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 21:37:31,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 21:37:31,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 21:37:31,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 21:37:31,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 21:37:31,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 21:37:31,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 21:37:31,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 21:37:31,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 21:37:31,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 21:37:31,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 21:37:31,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 21:37:31,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 21:37:31,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 21:37:31,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 21:37:31,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 21:37:31,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 21:37:31,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 21:37:31,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 21:37:31,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 21:37:31,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 21:37:31,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 21:37:31,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 21:37:31,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 21:37:31,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 21:37:31,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 21:37:31,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 21:37:31,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 21:37:31,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 21:37:31,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 21:37:31,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 21:37:31,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 21:37:31,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 21:37:31,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 21:37:31,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 21:37:31,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 21:37:31,370 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-26 21:37:31,386 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 21:37:31,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 21:37:31,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 21:37:31,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 21:37:31,388 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 21:37:31,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 21:37:31,389 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 21:37:31,389 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 21:37:31,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 21:37:31,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 21:37:31,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 21:37:31,390 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 21:37:31,390 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 21:37:31,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 21:37:31,390 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 21:37:31,391 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 21:37:31,391 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 21:37:31,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 21:37:31,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 21:37:31,392 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 21:37:31,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 21:37:31,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:37:31,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 21:37:31,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 21:37:31,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-26 21:37:31,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 21:37:31,393 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-26 21:37:31,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 21:37:31,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 21:37:31,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 21:37:31,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 21:37:31,716 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 21:37:31,717 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-26 21:37:31,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75067c978/4fadccf07dd74dea91a2a41406a4213a/FLAGaf57c85e5 [2019-11-26 21:37:32,372 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 21:37:32,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-26 21:37:32,385 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75067c978/4fadccf07dd74dea91a2a41406a4213a/FLAGaf57c85e5 [2019-11-26 21:37:32,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75067c978/4fadccf07dd74dea91a2a41406a4213a [2019-11-26 21:37:32,719 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 21:37:32,721 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 21:37:32,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 21:37:32,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 21:37:32,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 21:37:32,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:37:32" (1/1) ... [2019-11-26 21:37:32,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737469c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:37:32, skipping insertion in model container [2019-11-26 21:37:32,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:37:32" (1/1) ... [2019-11-26 21:37:32,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 21:37:32,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:37:33,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:37:33,202 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 21:37:33,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:37:33,336 INFO L208 MainTranslator]: Completed translation [2019-11-26 21:37:33,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:37:33 WrapperNode [2019-11-26 21:37:33,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 21:37:33,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 21:37:33,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 21:37:33,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 21:37:33,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:37:33" (1/1) ... [2019-11-26 21:37:33,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:37:33" (1/1) ... [2019-11-26 21:37:33,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:37:33" (1/1) ... [2019-11-26 21:37:33,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:37:33" (1/1) ... [2019-11-26 21:37:33,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:37:33" (1/1) ... [2019-11-26 21:37:33,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:37:33" (1/1) ... [2019-11-26 21:37:33,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:37:33" (1/1) ... [2019-11-26 21:37:33,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 21:37:33,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 21:37:33,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 21:37:33,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 21:37:33,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:37:33" (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-26 21:37:33,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-26 21:37:33,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 21:37:33,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-26 21:37:33,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-26 21:37:33,503 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-11-26 21:37:33,503 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-11-26 21:37:33,503 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-11-26 21:37:33,503 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-11-26 21:37:33,503 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-11-26 21:37:33,503 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-11-26 21:37:33,504 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-26 21:37:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-26 21:37:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-26 21:37:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-26 21:37:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-26 21:37:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-26 21:37:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-26 21:37:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-26 21:37:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-26 21:37:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-26 21:37:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-26 21:37:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-26 21:37:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-26 21:37:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-26 21:37:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-26 21:37:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-26 21:37:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-26 21:37:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-26 21:37:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-26 21:37:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-26 21:37:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-26 21:37:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-26 21:37:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-26 21:37:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-26 21:37:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-26 21:37:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-26 21:37:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-26 21:37:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-26 21:37:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-26 21:37:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-26 21:37:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-26 21:37:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-26 21:37:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-26 21:37:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-26 21:37:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-26 21:37:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-26 21:37:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-26 21:37:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-26 21:37:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-26 21:37:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-26 21:37:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-26 21:37:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-26 21:37:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-26 21:37:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-26 21:37:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-26 21:37:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-26 21:37:33,518 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-26 21:37:33,518 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-26 21:37:33,518 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-26 21:37:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-26 21:37:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-26 21:37:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-26 21:37:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-26 21:37:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-26 21:37:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-26 21:37:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-26 21:37:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-26 21:37:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-26 21:37:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-26 21:37:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-26 21:37:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-26 21:37:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-26 21:37:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-26 21:37:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-26 21:37:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-26 21:37:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-26 21:37:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-26 21:37:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-26 21:37:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-26 21:37:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-26 21:37:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-26 21:37:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-26 21:37:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-26 21:37:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-26 21:37:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-26 21:37:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-26 21:37:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-26 21:37:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-26 21:37:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-26 21:37:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-26 21:37:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-26 21:37:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-26 21:37:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-26 21:37:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-26 21:37:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-26 21:37:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-26 21:37:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-26 21:37:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-26 21:37:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-26 21:37:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-26 21:37:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-26 21:37:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-26 21:37:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-26 21:37:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-26 21:37:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-26 21:37:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-26 21:37:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-26 21:37:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-26 21:37:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-26 21:37:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-26 21:37:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-26 21:37:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-26 21:37:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-26 21:37:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-26 21:37:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-26 21:37:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-11-26 21:37:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-11-26 21:37:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 21:37:33,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 21:37:33,536 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-11-26 21:37:33,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 21:37:33,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 21:37:33,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 21:37:33,537 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-11-26 21:37:33,537 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-11-26 21:37:33,538 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-11-26 21:37:33,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-26 21:37:33,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 21:37:33,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 21:37:33,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-26 21:37:33,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 21:37:34,700 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 21:37:34,701 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-11-26 21:37:34,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:37:34 BoogieIcfgContainer [2019-11-26 21:37:34,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 21:37:34,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 21:37:34,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 21:37:34,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 21:37:34,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 09:37:32" (1/3) ... [2019-11-26 21:37:34,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43066cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:37:34, skipping insertion in model container [2019-11-26 21:37:34,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:37:33" (2/3) ... [2019-11-26 21:37:34,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43066cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:37:34, skipping insertion in model container [2019-11-26 21:37:34,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:37:34" (3/3) ... [2019-11-26 21:37:34,712 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2019-11-26 21:37:34,722 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 21:37:34,731 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 105 error locations. [2019-11-26 21:37:34,748 INFO L249 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2019-11-26 21:37:34,765 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 21:37:34,766 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 21:37:34,766 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 21:37:34,766 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 21:37:34,766 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 21:37:34,766 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 21:37:34,767 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 21:37:34,767 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 21:37:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states. [2019-11-26 21:37:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 21:37:34,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:34,805 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:37:34,806 INFO L410 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:34,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1848291795, now seen corresponding path program 1 times [2019-11-26 21:37:34,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:34,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575472354] [2019-11-26 21:37:34,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:37:34,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575472354] [2019-11-26 21:37:34,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:34,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 21:37:34,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295597755] [2019-11-26 21:37:34,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 21:37:34,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:35,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 21:37:35,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 21:37:35,010 INFO L87 Difference]: Start difference. First operand 279 states. Second operand 3 states. [2019-11-26 21:37:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:35,628 INFO L93 Difference]: Finished difference Result 319 states and 354 transitions. [2019-11-26 21:37:35,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 21:37:35,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-26 21:37:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:35,649 INFO L225 Difference]: With dead ends: 319 [2019-11-26 21:37:35,649 INFO L226 Difference]: Without dead ends: 315 [2019-11-26 21:37:35,652 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-26 21:37:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-26 21:37:35,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 277. [2019-11-26 21:37:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-26 21:37:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 303 transitions. [2019-11-26 21:37:35,743 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 303 transitions. Word has length 9 [2019-11-26 21:37:35,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:35,743 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 303 transitions. [2019-11-26 21:37:35,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 21:37:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 303 transitions. [2019-11-26 21:37:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 21:37:35,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:35,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:37:35,746 INFO L410 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:35,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1461424039, now seen corresponding path program 1 times [2019-11-26 21:37:35,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:35,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011584402] [2019-11-26 21:37:35,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:35,883 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-26 21:37:35,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011584402] [2019-11-26 21:37:35,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:35,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 21:37:35,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831891422] [2019-11-26 21:37:35,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 21:37:35,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:35,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 21:37:35,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 21:37:35,891 INFO L87 Difference]: Start difference. First operand 277 states and 303 transitions. Second operand 4 states. [2019-11-26 21:37:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:36,707 INFO L93 Difference]: Finished difference Result 332 states and 369 transitions. [2019-11-26 21:37:36,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 21:37:36,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-26 21:37:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:36,712 INFO L225 Difference]: With dead ends: 332 [2019-11-26 21:37:36,712 INFO L226 Difference]: Without dead ends: 332 [2019-11-26 21:37:36,713 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-26 21:37:36,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-26 21:37:36,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 275. [2019-11-26 21:37:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-26 21:37:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2019-11-26 21:37:36,735 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 10 [2019-11-26 21:37:36,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:36,736 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2019-11-26 21:37:36,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 21:37:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2019-11-26 21:37:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 21:37:36,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:36,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:37:36,738 INFO L410 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:36,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:36,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1461424040, now seen corresponding path program 1 times [2019-11-26 21:37:36,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:36,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254869092] [2019-11-26 21:37:36,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:36,813 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-26 21:37:36,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254869092] [2019-11-26 21:37:36,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:36,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 21:37:36,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082354367] [2019-11-26 21:37:36,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 21:37:36,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:36,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 21:37:36,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 21:37:36,816 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand 4 states. [2019-11-26 21:37:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:37,519 INFO L93 Difference]: Finished difference Result 341 states and 379 transitions. [2019-11-26 21:37:37,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 21:37:37,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-26 21:37:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:37,526 INFO L225 Difference]: With dead ends: 341 [2019-11-26 21:37:37,526 INFO L226 Difference]: Without dead ends: 341 [2019-11-26 21:37:37,527 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-26 21:37:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-26 21:37:37,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 273. [2019-11-26 21:37:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-26 21:37:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 299 transitions. [2019-11-26 21:37:37,544 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 299 transitions. Word has length 10 [2019-11-26 21:37:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:37,544 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 299 transitions. [2019-11-26 21:37:37,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 21:37:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 299 transitions. [2019-11-26 21:37:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 21:37:37,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:37,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:37:37,546 INFO L410 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash 180424867, now seen corresponding path program 1 times [2019-11-26 21:37:37,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:37,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825867990] [2019-11-26 21:37:37,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:37,607 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-26 21:37:37,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825867990] [2019-11-26 21:37:37,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:37,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 21:37:37,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252694925] [2019-11-26 21:37:37,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 21:37:37,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:37,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 21:37:37,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 21:37:37,613 INFO L87 Difference]: Start difference. First operand 273 states and 299 transitions. Second operand 4 states. [2019-11-26 21:37:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:38,186 INFO L93 Difference]: Finished difference Result 308 states and 335 transitions. [2019-11-26 21:37:38,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:37:38,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-26 21:37:38,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:38,190 INFO L225 Difference]: With dead ends: 308 [2019-11-26 21:37:38,191 INFO L226 Difference]: Without dead ends: 307 [2019-11-26 21:37:38,191 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-26 21:37:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-26 21:37:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 272. [2019-11-26 21:37:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-26 21:37:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2019-11-26 21:37:38,224 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 14 [2019-11-26 21:37:38,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:38,227 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2019-11-26 21:37:38,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 21:37:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2019-11-26 21:37:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 21:37:38,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:38,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:37:38,229 INFO L410 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:38,232 INFO L82 PathProgramCache]: Analyzing trace with hash 438887496, now seen corresponding path program 1 times [2019-11-26 21:37:38,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:38,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899945450] [2019-11-26 21:37:38,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:38,327 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-26 21:37:38,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899945450] [2019-11-26 21:37:38,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:38,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 21:37:38,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036992849] [2019-11-26 21:37:38,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 21:37:38,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:38,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 21:37:38,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 21:37:38,339 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand 4 states. [2019-11-26 21:37:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:38,954 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2019-11-26 21:37:38,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 21:37:38,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-26 21:37:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:38,957 INFO L225 Difference]: With dead ends: 314 [2019-11-26 21:37:38,957 INFO L226 Difference]: Without dead ends: 314 [2019-11-26 21:37:38,957 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-26 21:37:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-26 21:37:38,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 270. [2019-11-26 21:37:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-26 21:37:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2019-11-26 21:37:38,967 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 15 [2019-11-26 21:37:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:38,968 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2019-11-26 21:37:38,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 21:37:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2019-11-26 21:37:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 21:37:38,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:38,969 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:37:38,969 INFO L410 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:38,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:38,970 INFO L82 PathProgramCache]: Analyzing trace with hash 438887497, now seen corresponding path program 1 times [2019-11-26 21:37:38,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:38,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964198293] [2019-11-26 21:37:38,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:39,029 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-26 21:37:39,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964198293] [2019-11-26 21:37:39,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:39,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 21:37:39,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122164973] [2019-11-26 21:37:39,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 21:37:39,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:39,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 21:37:39,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 21:37:39,032 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand 4 states. [2019-11-26 21:37:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:39,701 INFO L93 Difference]: Finished difference Result 323 states and 355 transitions. [2019-11-26 21:37:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 21:37:39,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-26 21:37:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:39,704 INFO L225 Difference]: With dead ends: 323 [2019-11-26 21:37:39,704 INFO L226 Difference]: Without dead ends: 323 [2019-11-26 21:37:39,704 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-26 21:37:39,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-26 21:37:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 268. [2019-11-26 21:37:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-26 21:37:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2019-11-26 21:37:39,716 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 15 [2019-11-26 21:37:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:39,716 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2019-11-26 21:37:39,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 21:37:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2019-11-26 21:37:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 21:37:39,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:39,717 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-26 21:37:39,718 INFO L410 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:39,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:39,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1724277052, now seen corresponding path program 1 times [2019-11-26 21:37:39,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:39,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790612014] [2019-11-26 21:37:39,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:39,779 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-26 21:37:39,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790612014] [2019-11-26 21:37:39,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:39,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 21:37:39,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848866040] [2019-11-26 21:37:39,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:37:39,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:39,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:37:39,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:37:39,782 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand 5 states. [2019-11-26 21:37:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:40,479 INFO L93 Difference]: Finished difference Result 327 states and 359 transitions. [2019-11-26 21:37:40,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:37:40,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-26 21:37:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:40,482 INFO L225 Difference]: With dead ends: 327 [2019-11-26 21:37:40,482 INFO L226 Difference]: Without dead ends: 327 [2019-11-26 21:37:40,483 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-26 21:37:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-26 21:37:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-11-26 21:37:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-26 21:37:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 292 transitions. [2019-11-26 21:37:40,492 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 292 transitions. Word has length 21 [2019-11-26 21:37:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:40,492 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 292 transitions. [2019-11-26 21:37:40,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:37:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 292 transitions. [2019-11-26 21:37:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 21:37:40,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:40,494 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-26 21:37:40,494 INFO L410 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:40,494 INFO L82 PathProgramCache]: Analyzing trace with hash 410367502, now seen corresponding path program 1 times [2019-11-26 21:37:40,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:40,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107169764] [2019-11-26 21:37:40,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:40,584 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-26 21:37:40,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107169764] [2019-11-26 21:37:40,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:40,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 21:37:40,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922542038] [2019-11-26 21:37:40,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 21:37:40,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:40,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 21:37:40,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:37:40,592 INFO L87 Difference]: Start difference. First operand 268 states and 292 transitions. Second operand 7 states. [2019-11-26 21:37:41,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:41,550 INFO L93 Difference]: Finished difference Result 382 states and 420 transitions. [2019-11-26 21:37:41,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 21:37:41,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-26 21:37:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:41,556 INFO L225 Difference]: With dead ends: 382 [2019-11-26 21:37:41,556 INFO L226 Difference]: Without dead ends: 382 [2019-11-26 21:37:41,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-26 21:37:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-26 21:37:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 271. [2019-11-26 21:37:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-26 21:37:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2019-11-26 21:37:41,566 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 25 [2019-11-26 21:37:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:41,566 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2019-11-26 21:37:41,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 21:37:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2019-11-26 21:37:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 21:37:41,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:41,568 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-26 21:37:41,568 INFO L410 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:41,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:41,569 INFO L82 PathProgramCache]: Analyzing trace with hash 410353194, now seen corresponding path program 1 times [2019-11-26 21:37:41,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:41,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662806261] [2019-11-26 21:37:41,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:41,646 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-26 21:37:41,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662806261] [2019-11-26 21:37:41,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:41,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 21:37:41,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067036611] [2019-11-26 21:37:41,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 21:37:41,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:41,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 21:37:41,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:37:41,649 INFO L87 Difference]: Start difference. First operand 271 states and 297 transitions. Second operand 7 states. [2019-11-26 21:37:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:42,676 INFO L93 Difference]: Finished difference Result 310 states and 341 transitions. [2019-11-26 21:37:42,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 21:37:42,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-26 21:37:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:42,679 INFO L225 Difference]: With dead ends: 310 [2019-11-26 21:37:42,680 INFO L226 Difference]: Without dead ends: 310 [2019-11-26 21:37:42,680 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-26 21:37:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-26 21:37:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2019-11-26 21:37:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-26 21:37:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 289 transitions. [2019-11-26 21:37:42,689 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 289 transitions. Word has length 25 [2019-11-26 21:37:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:42,689 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 289 transitions. [2019-11-26 21:37:42,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 21:37:42,690 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 289 transitions. [2019-11-26 21:37:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 21:37:42,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:42,690 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-26 21:37:42,691 INFO L410 AbstractCegarLoop]: === Iteration 10 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:42,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:42,691 INFO L82 PathProgramCache]: Analyzing trace with hash 410353195, now seen corresponding path program 1 times [2019-11-26 21:37:42,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:42,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500507827] [2019-11-26 21:37:42,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:42,789 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-26 21:37:42,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500507827] [2019-11-26 21:37:42,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:42,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 21:37:42,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63120926] [2019-11-26 21:37:42,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 21:37:42,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:42,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 21:37:42,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:37:42,794 INFO L87 Difference]: Start difference. First operand 263 states and 289 transitions. Second operand 7 states. [2019-11-26 21:37:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:44,077 INFO L93 Difference]: Finished difference Result 351 states and 388 transitions. [2019-11-26 21:37:44,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 21:37:44,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-26 21:37:44,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:44,080 INFO L225 Difference]: With dead ends: 351 [2019-11-26 21:37:44,080 INFO L226 Difference]: Without dead ends: 351 [2019-11-26 21:37:44,081 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-26 21:37:44,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-26 21:37:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 288. [2019-11-26 21:37:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-26 21:37:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 321 transitions. [2019-11-26 21:37:44,098 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 321 transitions. Word has length 25 [2019-11-26 21:37:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:44,099 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 321 transitions. [2019-11-26 21:37:44,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 21:37:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 321 transitions. [2019-11-26 21:37:44,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 21:37:44,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:44,103 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:37:44,104 INFO L410 AbstractCegarLoop]: === Iteration 11 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:44,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:44,104 INFO L82 PathProgramCache]: Analyzing trace with hash -576712388, now seen corresponding path program 1 times [2019-11-26 21:37:44,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:44,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326229964] [2019-11-26 21:37:44,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:44,205 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-26 21:37:44,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326229964] [2019-11-26 21:37:44,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:44,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 21:37:44,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959222078] [2019-11-26 21:37:44,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 21:37:44,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:44,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 21:37:44,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 21:37:44,207 INFO L87 Difference]: Start difference. First operand 288 states and 321 transitions. Second operand 6 states. [2019-11-26 21:37:44,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:44,934 INFO L93 Difference]: Finished difference Result 307 states and 341 transitions. [2019-11-26 21:37:44,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:37:44,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-26 21:37:44,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:44,938 INFO L225 Difference]: With dead ends: 307 [2019-11-26 21:37:44,938 INFO L226 Difference]: Without dead ends: 307 [2019-11-26 21:37:44,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:37:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-26 21:37:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2019-11-26 21:37:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 21:37:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 318 transitions. [2019-11-26 21:37:44,947 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 318 transitions. Word has length 32 [2019-11-26 21:37:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:44,948 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 318 transitions. [2019-11-26 21:37:44,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 21:37:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 318 transitions. [2019-11-26 21:37:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 21:37:44,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:44,950 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:37:44,950 INFO L410 AbstractCegarLoop]: === Iteration 12 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:44,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:44,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1257129466, now seen corresponding path program 1 times [2019-11-26 21:37:44,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:44,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300684701] [2019-11-26 21:37:44,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:45,023 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-26 21:37:45,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300684701] [2019-11-26 21:37:45,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:45,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 21:37:45,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830134179] [2019-11-26 21:37:45,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 21:37:45,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:45,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 21:37:45,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 21:37:45,027 INFO L87 Difference]: Start difference. First operand 287 states and 318 transitions. Second operand 6 states. [2019-11-26 21:37:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:45,799 INFO L93 Difference]: Finished difference Result 306 states and 338 transitions. [2019-11-26 21:37:45,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:37:45,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-26 21:37:45,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:45,806 INFO L225 Difference]: With dead ends: 306 [2019-11-26 21:37:45,806 INFO L226 Difference]: Without dead ends: 306 [2019-11-26 21:37:45,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:37:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-26 21:37:45,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 286. [2019-11-26 21:37:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-26 21:37:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2019-11-26 21:37:45,817 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 32 [2019-11-26 21:37:45,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:45,817 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2019-11-26 21:37:45,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 21:37:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2019-11-26 21:37:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 21:37:45,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:45,819 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:37:45,819 INFO L410 AbstractCegarLoop]: === Iteration 13 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:45,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:45,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1283785288, now seen corresponding path program 1 times [2019-11-26 21:37:45,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:45,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975658847] [2019-11-26 21:37:45,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:45,954 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-26 21:37:45,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975658847] [2019-11-26 21:37:45,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:45,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-26 21:37:45,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200221545] [2019-11-26 21:37:45,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 21:37:45,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:45,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 21:37:45,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:37:45,957 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand 9 states. [2019-11-26 21:37:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:47,267 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2019-11-26 21:37:47,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:37:47,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-26 21:37:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:47,274 INFO L225 Difference]: With dead ends: 341 [2019-11-26 21:37:47,274 INFO L226 Difference]: Without dead ends: 341 [2019-11-26 21:37:47,275 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-26 21:37:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-26 21:37:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 286. [2019-11-26 21:37:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-26 21:37:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 314 transitions. [2019-11-26 21:37:47,283 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 314 transitions. Word has length 35 [2019-11-26 21:37:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:47,284 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 314 transitions. [2019-11-26 21:37:47,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 21:37:47,284 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 314 transitions. [2019-11-26 21:37:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 21:37:47,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:47,285 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:37:47,286 INFO L410 AbstractCegarLoop]: === Iteration 14 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:47,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash 584864395, now seen corresponding path program 1 times [2019-11-26 21:37:47,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:47,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4438744] [2019-11-26 21:37:47,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:47,386 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-26 21:37:47,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4438744] [2019-11-26 21:37:47,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:47,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-26 21:37:47,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157998811] [2019-11-26 21:37:47,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 21:37:47,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:47,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 21:37:47,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:37:47,389 INFO L87 Difference]: Start difference. First operand 286 states and 314 transitions. Second operand 9 states. [2019-11-26 21:37:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:48,675 INFO L93 Difference]: Finished difference Result 340 states and 371 transitions. [2019-11-26 21:37:48,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:37:48,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-26 21:37:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:48,679 INFO L225 Difference]: With dead ends: 340 [2019-11-26 21:37:48,679 INFO L226 Difference]: Without dead ends: 340 [2019-11-26 21:37:48,680 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-26 21:37:48,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-26 21:37:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2019-11-26 21:37:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-26 21:37:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 313 transitions. [2019-11-26 21:37:48,688 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 313 transitions. Word has length 35 [2019-11-26 21:37:48,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:48,689 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 313 transitions. [2019-11-26 21:37:48,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 21:37:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 313 transitions. [2019-11-26 21:37:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 21:37:48,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:48,690 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-26 21:37:48,690 INFO L410 AbstractCegarLoop]: === Iteration 15 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:48,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:48,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1142948309, now seen corresponding path program 1 times [2019-11-26 21:37:48,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:48,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186147674] [2019-11-26 21:37:48,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:48,840 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-26 21:37:48,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186147674] [2019-11-26 21:37:48,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:48,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 21:37:48,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293509421] [2019-11-26 21:37:48,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 21:37:48,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 21:37:48,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:37:48,843 INFO L87 Difference]: Start difference. First operand 286 states and 313 transitions. Second operand 11 states. [2019-11-26 21:37:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:50,783 INFO L93 Difference]: Finished difference Result 354 states and 389 transitions. [2019-11-26 21:37:50,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 21:37:50,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-26 21:37:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:50,786 INFO L225 Difference]: With dead ends: 354 [2019-11-26 21:37:50,786 INFO L226 Difference]: Without dead ends: 354 [2019-11-26 21:37:50,787 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-26 21:37:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-26 21:37:50,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 287. [2019-11-26 21:37:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 21:37:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 315 transitions. [2019-11-26 21:37:50,795 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 315 transitions. Word has length 36 [2019-11-26 21:37:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:50,796 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 315 transitions. [2019-11-26 21:37:50,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 21:37:50,796 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 315 transitions. [2019-11-26 21:37:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 21:37:50,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:50,797 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-26 21:37:50,797 INFO L410 AbstractCegarLoop]: === Iteration 16 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1142948308, now seen corresponding path program 1 times [2019-11-26 21:37:50,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:50,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735236810] [2019-11-26 21:37:50,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:50,926 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-26 21:37:50,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735236810] [2019-11-26 21:37:50,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:50,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 21:37:50,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855751709] [2019-11-26 21:37:50,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 21:37:50,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:50,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 21:37:50,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:37:50,928 INFO L87 Difference]: Start difference. First operand 287 states and 315 transitions. Second operand 9 states. [2019-11-26 21:37:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:52,550 INFO L93 Difference]: Finished difference Result 338 states and 369 transitions. [2019-11-26 21:37:52,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:37:52,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-26 21:37:52,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:52,554 INFO L225 Difference]: With dead ends: 338 [2019-11-26 21:37:52,554 INFO L226 Difference]: Without dead ends: 338 [2019-11-26 21:37:52,555 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-26 21:37:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-26 21:37:52,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 287. [2019-11-26 21:37:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 21:37:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2019-11-26 21:37:52,572 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 36 [2019-11-26 21:37:52,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:52,573 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2019-11-26 21:37:52,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 21:37:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2019-11-26 21:37:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 21:37:52,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:52,576 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-26 21:37:52,576 INFO L410 AbstractCegarLoop]: === Iteration 17 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:52,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:52,577 INFO L82 PathProgramCache]: Analyzing trace with hash 950542285, now seen corresponding path program 1 times [2019-11-26 21:37:52,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:52,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206857849] [2019-11-26 21:37:52,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:52,784 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-26 21:37:52,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206857849] [2019-11-26 21:37:52,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:52,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 21:37:52,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556321314] [2019-11-26 21:37:52,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 21:37:52,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:52,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 21:37:52,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:37:52,786 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand 11 states. [2019-11-26 21:37:54,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:54,517 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2019-11-26 21:37:54,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 21:37:54,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-26 21:37:54,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:54,520 INFO L225 Difference]: With dead ends: 352 [2019-11-26 21:37:54,520 INFO L226 Difference]: Without dead ends: 352 [2019-11-26 21:37:54,520 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-26 21:37:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-26 21:37:54,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 287. [2019-11-26 21:37:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 21:37:54,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 313 transitions. [2019-11-26 21:37:54,528 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 313 transitions. Word has length 36 [2019-11-26 21:37:54,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:54,529 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 313 transitions. [2019-11-26 21:37:54,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 21:37:54,529 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 313 transitions. [2019-11-26 21:37:54,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 21:37:54,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:54,530 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-26 21:37:54,531 INFO L410 AbstractCegarLoop]: === Iteration 18 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:54,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:54,531 INFO L82 PathProgramCache]: Analyzing trace with hash 950542286, now seen corresponding path program 1 times [2019-11-26 21:37:54,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:54,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257484833] [2019-11-26 21:37:54,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:37:54,659 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-26 21:37:54,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257484833] [2019-11-26 21:37:54,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:37:54,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 21:37:54,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781459521] [2019-11-26 21:37:54,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 21:37:54,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:37:54,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 21:37:54,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:37:54,662 INFO L87 Difference]: Start difference. First operand 287 states and 313 transitions. Second operand 9 states. [2019-11-26 21:37:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:37:56,129 INFO L93 Difference]: Finished difference Result 336 states and 367 transitions. [2019-11-26 21:37:56,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:37:56,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-26 21:37:56,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:37:56,132 INFO L225 Difference]: With dead ends: 336 [2019-11-26 21:37:56,133 INFO L226 Difference]: Without dead ends: 336 [2019-11-26 21:37:56,133 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-26 21:37:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-26 21:37:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 287. [2019-11-26 21:37:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 21:37:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 312 transitions. [2019-11-26 21:37:56,141 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 312 transitions. Word has length 36 [2019-11-26 21:37:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:37:56,141 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 312 transitions. [2019-11-26 21:37:56,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 21:37:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 312 transitions. [2019-11-26 21:37:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-26 21:37:56,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:37:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:37:56,143 INFO L410 AbstractCegarLoop]: === Iteration 19 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 21:37:56,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:37:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash 927806725, now seen corresponding path program 1 times [2019-11-26 21:37:56,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:37:56,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56426144] [2019-11-26 21:37:56,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:37:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 21:37:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 21:37:56,204 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-26 21:37:56,205 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 21:37:56,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 09:37:56 BoogieIcfgContainer [2019-11-26 21:37:56,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 21:37:56,273 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 21:37:56,273 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 21:37:56,274 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 21:37:56,274 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:37:34" (3/4) ... [2019-11-26 21:37:56,277 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 21:37:56,359 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-26 21:37:56,360 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 21:37:56,362 INFO L168 Benchmark]: Toolchain (without parser) took 23640.90 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.1 MB). Free memory was 956.3 MB in the beginning and 855.3 MB in the end (delta: 101.1 MB). Peak memory consumption was 503.2 MB. Max. memory is 11.5 GB. [2019-11-26 21:37:56,363 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:37:56,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-26 21:37:56,367 INFO L168 Benchmark]: Boogie Preprocessor took 102.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:37:56,368 INFO L168 Benchmark]: RCFGBuilder took 1262.96 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.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2019-11-26 21:37:56,368 INFO L168 Benchmark]: TraceAbstraction took 21567.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.1 MB). Free memory was 1.0 GB in the beginning and 866.5 MB in the end (delta: 151.8 MB). Peak memory consumption was 413.9 MB. Max. memory is 11.5 GB. [2019-11-26 21:37:56,369 INFO L168 Benchmark]: Witness Printer took 86.79 ms. Allocated memory is still 1.4 GB. Free memory was 866.5 MB in the beginning and 855.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2019-11-26 21:37:56,370 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 615.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1262.96 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.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21567.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.1 MB). Free memory was 1.0 GB in the beginning and 866.5 MB in the end (delta: 151.8 MB). Peak memory consumption was 413.9 MB. Max. memory is 11.5 GB. * Witness Printer took 86.79 ms. Allocated memory is still 1.4 GB. Free memory was 866.5 MB in the beginning and 855.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] struct list *data = ((void *)0); VAL [data={0:0}] [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L630] COND FALSE !(!node) VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L632] node->next = node VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L633] node->value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L634] struct list *item = malloc(sizeof *item); VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L635] COND FALSE !(!item) VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L637] item->slist = node VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L638] item->next = data VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L639] data = item VAL [data={-2:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) VAL [data={-2:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L643] CALL inspect_before(data) VAL [shape={-2:0}] [L604] COND FALSE !(!(shape)) VAL [shape={-2:0}, shape={-2:0}] [L605] shape->next VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) VAL [shape={-2:0}, shape={-2:0}] [L612] EXPR shape->next VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}] [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}] [L614] EXPR shape->slist->next VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L614] CALL fail() [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 285 locations, 105 error locations. Result: UNSAFE, OverallTime: 21.4s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3941 SDtfs, 5118 SDslu, 5522 SDs, 0 SdLazy, 15502 SolverSat, 622 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 56 SyntacticMatches, 9 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 958 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 85308 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...