./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 534681b11e8e68e6058985d885b01f2cbfa43e5b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 19:09:56,698 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 19:09:56,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 19:09:56,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 19:09:56,708 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 19:09:56,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 19:09:56,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 19:09:56,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 19:09:56,711 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 19:09:56,712 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 19:09:56,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 19:09:56,713 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 19:09:56,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 19:09:56,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 19:09:56,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 19:09:56,715 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 19:09:56,716 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 19:09:56,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 19:09:56,718 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 19:09:56,719 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 19:09:56,720 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 19:09:56,721 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 19:09:56,722 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 19:09:56,723 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 19:09:56,723 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 19:09:56,723 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 19:09:56,724 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 19:09:56,725 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 19:09:56,725 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 19:09:56,726 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 19:09:56,726 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 19:09:56,727 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 19:09:56,727 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 19:09:56,727 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 19:09:56,727 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 19:09:56,728 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 19:09:56,728 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2018-12-02 19:09:56,739 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 19:09:56,739 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 19:09:56,739 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 19:09:56,739 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 19:09:56,740 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 19:09:56,740 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 19:09:56,740 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 19:09:56,740 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 19:09:56,740 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 19:09:56,740 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 19:09:56,740 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 19:09:56,740 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 19:09:56,741 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 19:09:56,741 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 19:09:56,741 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 19:09:56,741 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 19:09:56,742 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 19:09:56,742 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 19:09:56,742 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 19:09:56,742 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 19:09:56,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 19:09:56,742 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 19:09:56,742 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 19:09:56,742 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 19:09:56,743 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 19:09:56,743 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 19:09:56,743 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 19:09:56,743 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 19:09:56,743 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 19:09:56,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 19:09:56,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 19:09:56,743 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 19:09:56,743 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 19:09:56,743 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 19:09:56,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 19:09:56,744 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan 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 -> Taipan 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 [2018-12-02 19:09:56,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 19:09:56,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 19:09:56,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 19:09:56,780 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 19:09:56,780 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 19:09:56,780 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan/../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-12-02 19:09:56,821 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan/data/98759119b/68fba7a9f45345d39eb21ef9d30ad9c6/FLAG588ecf192 [2018-12-02 19:09:57,142 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 19:09:57,143 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-12-02 19:09:57,149 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan/data/98759119b/68fba7a9f45345d39eb21ef9d30ad9c6/FLAG588ecf192 [2018-12-02 19:09:57,157 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan/data/98759119b/68fba7a9f45345d39eb21ef9d30ad9c6 [2018-12-02 19:09:57,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 19:09:57,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 19:09:57,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 19:09:57,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 19:09:57,162 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 19:09:57,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:09:57" (1/1) ... [2018-12-02 19:09:57,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75090e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:57, skipping insertion in model container [2018-12-02 19:09:57,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:09:57" (1/1) ... [2018-12-02 19:09:57,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 19:09:57,197 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 19:09:57,360 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 19:09:57,399 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 19:09:57,429 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 19:09:57,450 INFO L195 MainTranslator]: Completed translation [2018-12-02 19:09:57,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:57 WrapperNode [2018-12-02 19:09:57,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 19:09:57,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 19:09:57,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 19:09:57,451 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 19:09:57,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:57" (1/1) ... [2018-12-02 19:09:57,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:57" (1/1) ... [2018-12-02 19:09:57,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 19:09:57,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 19:09:57,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 19:09:57,470 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 19:09:57,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:57" (1/1) ... [2018-12-02 19:09:57,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:57" (1/1) ... [2018-12-02 19:09:57,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:57" (1/1) ... [2018-12-02 19:09:57,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:57" (1/1) ... [2018-12-02 19:09:57,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:57" (1/1) ... [2018-12-02 19:09:57,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:57" (1/1) ... [2018-12-02 19:09:57,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:57" (1/1) ... [2018-12-02 19:09:57,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 19:09:57,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 19:09:57,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 19:09:57,498 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 19:09:57,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan/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 [2018-12-02 19:09:57,529 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2018-12-02 19:09:57,529 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-12-02 19:09:57,529 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2018-12-02 19:09:57,529 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-12-02 19:09:57,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 19:09:57,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 19:09:57,529 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-12-02 19:09:57,529 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-12-02 19:09:57,529 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-12-02 19:09:57,529 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-12-02 19:09:57,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 19:09:57,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 19:09:57,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 19:09:57,530 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2018-12-02 19:09:57,530 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-12-02 19:09:57,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 19:09:57,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 19:09:57,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 19:09:57,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 19:09:57,530 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-12-02 19:09:57,530 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-12-02 19:09:57,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 19:09:57,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 19:09:57,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 19:09:57,915 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 19:09:57,915 INFO L280 CfgBuilder]: Removed 33 assue(true) statements. [2018-12-02 19:09:57,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:09:57 BoogieIcfgContainer [2018-12-02 19:09:57,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 19:09:57,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 19:09:57,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 19:09:57,918 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 19:09:57,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:09:57" (1/3) ... [2018-12-02 19:09:57,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7817ea0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:09:57, skipping insertion in model container [2018-12-02 19:09:57,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:09:57" (2/3) ... [2018-12-02 19:09:57,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7817ea0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:09:57, skipping insertion in model container [2018-12-02 19:09:57,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:09:57" (3/3) ... [2018-12-02 19:09:57,919 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-12-02 19:09:57,925 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 19:09:57,930 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-12-02 19:09:57,939 INFO L257 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2018-12-02 19:09:57,955 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 19:09:57,955 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 19:09:57,955 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 19:09:57,955 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 19:09:57,955 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 19:09:57,955 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 19:09:57,956 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 19:09:57,956 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 19:09:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states. [2018-12-02 19:09:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 19:09:57,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:09:57,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:09:57,976 INFO L423 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:09:57,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:09:57,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1197190748, now seen corresponding path program 1 times [2018-12-02 19:09:57,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:09:58,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:09:58,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:09:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:09:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:09:58,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:09:58,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 19:09:58,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:09:58,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 19:09:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 19:09:58,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 19:09:58,066 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 2 states. [2018-12-02 19:09:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:09:58,085 INFO L93 Difference]: Finished difference Result 270 states and 295 transitions. [2018-12-02 19:09:58,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 19:09:58,086 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-02 19:09:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:09:58,094 INFO L225 Difference]: With dead ends: 270 [2018-12-02 19:09:58,094 INFO L226 Difference]: Without dead ends: 253 [2018-12-02 19:09:58,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 19:09:58,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-12-02 19:09:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-12-02 19:09:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-02 19:09:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2018-12-02 19:09:58,128 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 9 [2018-12-02 19:09:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:09:58,128 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2018-12-02 19:09:58,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 19:09:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2018-12-02 19:09:58,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 19:09:58,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:09:58,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:09:58,129 INFO L423 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:09:58,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:09:58,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1540745701, now seen corresponding path program 1 times [2018-12-02 19:09:58,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:09:58,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:09:58,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:09:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:09:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:09:58,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:09:58,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 19:09:58,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:09:58,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 19:09:58,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 19:09:58,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:09:58,160 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand 3 states. [2018-12-02 19:09:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:09:58,305 INFO L93 Difference]: Finished difference Result 271 states and 289 transitions. [2018-12-02 19:09:58,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 19:09:58,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 19:09:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:09:58,307 INFO L225 Difference]: With dead ends: 271 [2018-12-02 19:09:58,307 INFO L226 Difference]: Without dead ends: 271 [2018-12-02 19:09:58,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:09:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-02 19:09:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 251. [2018-12-02 19:09:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-02 19:09:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 264 transitions. [2018-12-02 19:09:58,317 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 264 transitions. Word has length 10 [2018-12-02 19:09:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:09:58,317 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 264 transitions. [2018-12-02 19:09:58,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 19:09:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 264 transitions. [2018-12-02 19:09:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 19:09:58,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:09:58,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:09:58,318 INFO L423 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:09:58,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:09:58,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1540745702, now seen corresponding path program 1 times [2018-12-02 19:09:58,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:09:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:09:58,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:09:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:09:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:09:58,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:09:58,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 19:09:58,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:09:58,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 19:09:58,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 19:09:58,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:09:58,353 INFO L87 Difference]: Start difference. First operand 251 states and 264 transitions. Second operand 3 states. [2018-12-02 19:09:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:09:58,451 INFO L93 Difference]: Finished difference Result 279 states and 298 transitions. [2018-12-02 19:09:58,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 19:09:58,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 19:09:58,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:09:58,453 INFO L225 Difference]: With dead ends: 279 [2018-12-02 19:09:58,453 INFO L226 Difference]: Without dead ends: 279 [2018-12-02 19:09:58,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:09:58,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-02 19:09:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 249. [2018-12-02 19:09:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-02 19:09:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 262 transitions. [2018-12-02 19:09:58,460 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 262 transitions. Word has length 10 [2018-12-02 19:09:58,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:09:58,460 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 262 transitions. [2018-12-02 19:09:58,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 19:09:58,460 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 262 transitions. [2018-12-02 19:09:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 19:09:58,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:09:58,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:09:58,461 INFO L423 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:09:58,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:09:58,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1540744723, now seen corresponding path program 1 times [2018-12-02 19:09:58,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:09:58,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:09:58,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:09:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:09:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:09:58,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:09:58,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 19:09:58,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:09:58,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 19:09:58,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 19:09:58,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:09:58,475 INFO L87 Difference]: Start difference. First operand 249 states and 262 transitions. Second operand 3 states. [2018-12-02 19:09:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:09:58,591 INFO L93 Difference]: Finished difference Result 289 states and 311 transitions. [2018-12-02 19:09:58,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 19:09:58,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 19:09:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:09:58,593 INFO L225 Difference]: With dead ends: 289 [2018-12-02 19:09:58,593 INFO L226 Difference]: Without dead ends: 288 [2018-12-02 19:09:58,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:09:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-12-02 19:09:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 252. [2018-12-02 19:09:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-02 19:09:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 266 transitions. [2018-12-02 19:09:58,599 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 266 transitions. Word has length 10 [2018-12-02 19:09:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:09:58,600 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 266 transitions. [2018-12-02 19:09:58,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 19:09:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 266 transitions. [2018-12-02 19:09:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 19:09:58,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:09:58,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:09:58,600 INFO L423 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:09:58,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:09:58,601 INFO L82 PathProgramCache]: Analyzing trace with hash 551922422, now seen corresponding path program 1 times [2018-12-02 19:09:58,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:09:58,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:09:58,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:09:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:09:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:09:58,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:09:58,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 19:09:58,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:09:58,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 19:09:58,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 19:09:58,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:09:58,620 INFO L87 Difference]: Start difference. First operand 252 states and 266 transitions. Second operand 3 states. [2018-12-02 19:09:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:09:58,641 INFO L93 Difference]: Finished difference Result 267 states and 279 transitions. [2018-12-02 19:09:58,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 19:09:58,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-02 19:09:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:09:58,643 INFO L225 Difference]: With dead ends: 267 [2018-12-02 19:09:58,643 INFO L226 Difference]: Without dead ends: 266 [2018-12-02 19:09:58,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:09:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-02 19:09:58,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 251. [2018-12-02 19:09:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-02 19:09:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 264 transitions. [2018-12-02 19:09:58,651 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 264 transitions. Word has length 14 [2018-12-02 19:09:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:09:58,651 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 264 transitions. [2018-12-02 19:09:58,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 19:09:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 264 transitions. [2018-12-02 19:09:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 19:09:58,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:09:58,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:09:58,652 INFO L423 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:09:58,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:09:58,653 INFO L82 PathProgramCache]: Analyzing trace with hash -274852995, now seen corresponding path program 1 times [2018-12-02 19:09:58,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:09:58,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:09:58,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:09:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:09:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:09:58,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:09:58,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 19:09:58,681 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:09:58,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 19:09:58,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 19:09:58,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:09:58,681 INFO L87 Difference]: Start difference. First operand 251 states and 264 transitions. Second operand 3 states. [2018-12-02 19:09:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:09:58,773 INFO L93 Difference]: Finished difference Result 270 states and 285 transitions. [2018-12-02 19:09:58,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 19:09:58,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-02 19:09:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:09:58,775 INFO L225 Difference]: With dead ends: 270 [2018-12-02 19:09:58,775 INFO L226 Difference]: Without dead ends: 270 [2018-12-02 19:09:58,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:09:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-02 19:09:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 249. [2018-12-02 19:09:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-02 19:09:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 262 transitions. [2018-12-02 19:09:58,779 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 262 transitions. Word has length 15 [2018-12-02 19:09:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:09:58,779 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 262 transitions. [2018-12-02 19:09:58,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 19:09:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 262 transitions. [2018-12-02 19:09:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 19:09:58,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:09:58,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:09:58,780 INFO L423 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:09:58,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:09:58,780 INFO L82 PathProgramCache]: Analyzing trace with hash -274852994, now seen corresponding path program 1 times [2018-12-02 19:09:58,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:09:58,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:09:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:09:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:09:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:09:58,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:09:58,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 19:09:58,812 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:09:58,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 19:09:58,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 19:09:58,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:09:58,812 INFO L87 Difference]: Start difference. First operand 249 states and 262 transitions. Second operand 3 states. [2018-12-02 19:09:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:09:58,892 INFO L93 Difference]: Finished difference Result 278 states and 294 transitions. [2018-12-02 19:09:58,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 19:09:58,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-02 19:09:58,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:09:58,894 INFO L225 Difference]: With dead ends: 278 [2018-12-02 19:09:58,894 INFO L226 Difference]: Without dead ends: 278 [2018-12-02 19:09:58,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:09:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-02 19:09:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 247. [2018-12-02 19:09:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-02 19:09:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 260 transitions. [2018-12-02 19:09:58,898 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 260 transitions. Word has length 15 [2018-12-02 19:09:58,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:09:58,898 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 260 transitions. [2018-12-02 19:09:58,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 19:09:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 260 transitions. [2018-12-02 19:09:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 19:09:58,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:09:58,899 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:09:58,899 INFO L423 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:09:58,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:09:58,899 INFO L82 PathProgramCache]: Analyzing trace with hash 47797589, now seen corresponding path program 1 times [2018-12-02 19:09:58,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:09:58,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:09:58,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:09:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:09:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:09:58,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:09:58,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 19:09:58,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:09:58,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 19:09:58,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 19:09:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:09:58,925 INFO L87 Difference]: Start difference. First operand 247 states and 260 transitions. Second operand 4 states. [2018-12-02 19:09:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:09:58,961 INFO L93 Difference]: Finished difference Result 282 states and 298 transitions. [2018-12-02 19:09:58,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 19:09:58,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-02 19:09:58,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:09:58,962 INFO L225 Difference]: With dead ends: 282 [2018-12-02 19:09:58,962 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 19:09:58,963 INFO L631 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 [2018-12-02 19:09:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 19:09:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 247. [2018-12-02 19:09:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-02 19:09:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 259 transitions. [2018-12-02 19:09:58,969 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 259 transitions. Word has length 21 [2018-12-02 19:09:58,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:09:58,969 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 259 transitions. [2018-12-02 19:09:58,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 19:09:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 259 transitions. [2018-12-02 19:09:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 19:09:58,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:09:58,970 INFO L402 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] [2018-12-02 19:09:58,970 INFO L423 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:09:58,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:09:58,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1371821768, now seen corresponding path program 1 times [2018-12-02 19:09:58,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:09:58,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:09:58,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:58,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:09:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:09:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:09:59,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:09:59,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:09:59,037 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:09:59,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 19:09:59,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 19:09:59,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:09:59,038 INFO L87 Difference]: Start difference. First operand 247 states and 259 transitions. Second operand 6 states. [2018-12-02 19:09:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:09:59,340 INFO L93 Difference]: Finished difference Result 321 states and 337 transitions. [2018-12-02 19:09:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 19:09:59,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-12-02 19:09:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:09:59,341 INFO L225 Difference]: With dead ends: 321 [2018-12-02 19:09:59,341 INFO L226 Difference]: Without dead ends: 321 [2018-12-02 19:09:59,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:09:59,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-02 19:09:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 277. [2018-12-02 19:09:59,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-02 19:09:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 304 transitions. [2018-12-02 19:09:59,346 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 304 transitions. Word has length 25 [2018-12-02 19:09:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:09:59,346 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 304 transitions. [2018-12-02 19:09:59,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 19:09:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 304 transitions. [2018-12-02 19:09:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 19:09:59,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:09:59,347 INFO L402 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] [2018-12-02 19:09:59,347 INFO L423 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:09:59,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:09:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1371821769, now seen corresponding path program 1 times [2018-12-02 19:09:59,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:09:59,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:59,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:09:59,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:59,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:09:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:09:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:09:59,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:09:59,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:09:59,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:09:59,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 19:09:59,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 19:09:59,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:09:59,375 INFO L87 Difference]: Start difference. First operand 277 states and 304 transitions. Second operand 6 states. [2018-12-02 19:09:59,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:09:59,589 INFO L93 Difference]: Finished difference Result 279 states and 297 transitions. [2018-12-02 19:09:59,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 19:09:59,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-12-02 19:09:59,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:09:59,590 INFO L225 Difference]: With dead ends: 279 [2018-12-02 19:09:59,590 INFO L226 Difference]: Without dead ends: 279 [2018-12-02 19:09:59,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:09:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-02 19:09:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2018-12-02 19:09:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-02 19:09:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 285 transitions. [2018-12-02 19:09:59,596 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 285 transitions. Word has length 25 [2018-12-02 19:09:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:09:59,597 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 285 transitions. [2018-12-02 19:09:59,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 19:09:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 285 transitions. [2018-12-02 19:09:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 19:09:59,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:09:59,598 INFO L402 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] [2018-12-02 19:09:59,598 INFO L423 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:09:59,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:09:59,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2140859640, now seen corresponding path program 1 times [2018-12-02 19:09:59,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:09:59,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:59,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:09:59,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:09:59,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:09:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:09:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:09:59,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:09:59,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 19:09:59,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:09:59,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 19:09:59,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 19:09:59,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 19:09:59,720 INFO L87 Difference]: Start difference. First operand 268 states and 285 transitions. Second operand 11 states. [2018-12-02 19:10:00,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:10:00,120 INFO L93 Difference]: Finished difference Result 295 states and 311 transitions. [2018-12-02 19:10:00,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 19:10:00,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-12-02 19:10:00,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:10:00,121 INFO L225 Difference]: With dead ends: 295 [2018-12-02 19:10:00,122 INFO L226 Difference]: Without dead ends: 295 [2018-12-02 19:10:00,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-12-02 19:10:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-02 19:10:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 269. [2018-12-02 19:10:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-02 19:10:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 287 transitions. [2018-12-02 19:10:00,126 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 287 transitions. Word has length 36 [2018-12-02 19:10:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:10:00,127 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 287 transitions. [2018-12-02 19:10:00,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 19:10:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 287 transitions. [2018-12-02 19:10:00,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 19:10:00,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:10:00,128 INFO L402 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] [2018-12-02 19:10:00,128 INFO L423 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:10:00,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:10:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2140859639, now seen corresponding path program 1 times [2018-12-02 19:10:00,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:10:00,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:00,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:10:00,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:00,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:10:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:10:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:10:00,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:10:00,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 19:10:00,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:10:00,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 19:10:00,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 19:10:00,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:10:00,210 INFO L87 Difference]: Start difference. First operand 269 states and 287 transitions. Second operand 8 states. [2018-12-02 19:10:00,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:10:00,595 INFO L93 Difference]: Finished difference Result 294 states and 310 transitions. [2018-12-02 19:10:00,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 19:10:00,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-02 19:10:00,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:10:00,597 INFO L225 Difference]: With dead ends: 294 [2018-12-02 19:10:00,597 INFO L226 Difference]: Without dead ends: 294 [2018-12-02 19:10:00,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-02 19:10:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-02 19:10:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 269. [2018-12-02 19:10:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-02 19:10:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 286 transitions. [2018-12-02 19:10:00,604 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 286 transitions. Word has length 36 [2018-12-02 19:10:00,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:10:00,604 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 286 transitions. [2018-12-02 19:10:00,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 19:10:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 286 transitions. [2018-12-02 19:10:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 19:10:00,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:10:00,605 INFO L402 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] [2018-12-02 19:10:00,605 INFO L423 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:10:00,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:10:00,606 INFO L82 PathProgramCache]: Analyzing trace with hash -47369046, now seen corresponding path program 1 times [2018-12-02 19:10:00,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:10:00,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:00,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:10:00,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:00,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:10:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:10:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:10:00,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:10:00,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 19:10:00,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:10:00,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 19:10:00,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 19:10:00,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 19:10:00,737 INFO L87 Difference]: Start difference. First operand 269 states and 286 transitions. Second operand 11 states. [2018-12-02 19:10:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:10:01,181 INFO L93 Difference]: Finished difference Result 293 states and 309 transitions. [2018-12-02 19:10:01,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 19:10:01,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-12-02 19:10:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:10:01,183 INFO L225 Difference]: With dead ends: 293 [2018-12-02 19:10:01,183 INFO L226 Difference]: Without dead ends: 293 [2018-12-02 19:10:01,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-12-02 19:10:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-02 19:10:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 269. [2018-12-02 19:10:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-02 19:10:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 285 transitions. [2018-12-02 19:10:01,188 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 285 transitions. Word has length 36 [2018-12-02 19:10:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:10:01,188 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 285 transitions. [2018-12-02 19:10:01,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 19:10:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 285 transitions. [2018-12-02 19:10:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 19:10:01,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:10:01,189 INFO L402 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] [2018-12-02 19:10:01,189 INFO L423 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:10:01,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:10:01,189 INFO L82 PathProgramCache]: Analyzing trace with hash -47369045, now seen corresponding path program 1 times [2018-12-02 19:10:01,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:10:01,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:01,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:10:01,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:01,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:10:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:10:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:10:01,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:10:01,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 19:10:01,267 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:10:01,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 19:10:01,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 19:10:01,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:10:01,268 INFO L87 Difference]: Start difference. First operand 269 states and 285 transitions. Second operand 8 states. [2018-12-02 19:10:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:10:01,644 INFO L93 Difference]: Finished difference Result 292 states and 308 transitions. [2018-12-02 19:10:01,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 19:10:01,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-02 19:10:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:10:01,646 INFO L225 Difference]: With dead ends: 292 [2018-12-02 19:10:01,646 INFO L226 Difference]: Without dead ends: 292 [2018-12-02 19:10:01,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-02 19:10:01,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-12-02 19:10:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 269. [2018-12-02 19:10:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-02 19:10:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 284 transitions. [2018-12-02 19:10:01,650 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 284 transitions. Word has length 36 [2018-12-02 19:10:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:10:01,650 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 284 transitions. [2018-12-02 19:10:01,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 19:10:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 284 transitions. [2018-12-02 19:10:01,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 19:10:01,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:10:01,650 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:10:01,651 INFO L423 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:10:01,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:10:01,651 INFO L82 PathProgramCache]: Analyzing trace with hash 486782864, now seen corresponding path program 1 times [2018-12-02 19:10:01,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:10:01,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:01,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:10:01,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:01,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:10:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:10:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:10:01,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:10:01,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 19:10:01,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:10:01,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 19:10:01,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 19:10:01,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 19:10:01,779 INFO L87 Difference]: Start difference. First operand 269 states and 284 transitions. Second operand 12 states. [2018-12-02 19:10:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:10:02,457 INFO L93 Difference]: Finished difference Result 246 states and 260 transitions. [2018-12-02 19:10:02,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 19:10:02,457 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-12-02 19:10:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:10:02,458 INFO L225 Difference]: With dead ends: 246 [2018-12-02 19:10:02,458 INFO L226 Difference]: Without dead ends: 235 [2018-12-02 19:10:02,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-12-02 19:10:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-12-02 19:10:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 217. [2018-12-02 19:10:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-02 19:10:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 230 transitions. [2018-12-02 19:10:02,461 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 230 transitions. Word has length 41 [2018-12-02 19:10:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:10:02,461 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 230 transitions. [2018-12-02 19:10:02,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 19:10:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 230 transitions. [2018-12-02 19:10:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 19:10:02,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:10:02,461 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:10:02,462 INFO L423 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:10:02,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:10:02,462 INFO L82 PathProgramCache]: Analyzing trace with hash 787947303, now seen corresponding path program 1 times [2018-12-02 19:10:02,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:10:02,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:02,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:10:02,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:02,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:10:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:10:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:10:02,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:10:02,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:10:02,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:10:02,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 19:10:02,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 19:10:02,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:10:02,489 INFO L87 Difference]: Start difference. First operand 217 states and 230 transitions. Second operand 6 states. [2018-12-02 19:10:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:10:02,708 INFO L93 Difference]: Finished difference Result 247 states and 266 transitions. [2018-12-02 19:10:02,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 19:10:02,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-02 19:10:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:10:02,710 INFO L225 Difference]: With dead ends: 247 [2018-12-02 19:10:02,710 INFO L226 Difference]: Without dead ends: 247 [2018-12-02 19:10:02,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:10:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-12-02 19:10:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 217. [2018-12-02 19:10:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-02 19:10:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-12-02 19:10:02,714 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 46 [2018-12-02 19:10:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:10:02,715 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-12-02 19:10:02,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 19:10:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-12-02 19:10:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 19:10:02,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:10:02,715 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:10:02,716 INFO L423 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:10:02,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:10:02,716 INFO L82 PathProgramCache]: Analyzing trace with hash 787947304, now seen corresponding path program 1 times [2018-12-02 19:10:02,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:10:02,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:02,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:10:02,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:02,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:10:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:10:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:10:02,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:10:02,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:10:02,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:10:02,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 19:10:02,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 19:10:02,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:10:02,763 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 6 states. [2018-12-02 19:10:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:10:02,980 INFO L93 Difference]: Finished difference Result 256 states and 275 transitions. [2018-12-02 19:10:02,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 19:10:02,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-02 19:10:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:10:02,981 INFO L225 Difference]: With dead ends: 256 [2018-12-02 19:10:02,981 INFO L226 Difference]: Without dead ends: 256 [2018-12-02 19:10:02,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:10:02,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-12-02 19:10:02,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 229. [2018-12-02 19:10:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-02 19:10:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 247 transitions. [2018-12-02 19:10:02,985 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 247 transitions. Word has length 46 [2018-12-02 19:10:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:10:02,986 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 247 transitions. [2018-12-02 19:10:02,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 19:10:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 247 transitions. [2018-12-02 19:10:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 19:10:02,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:10:02,986 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:10:02,987 INFO L423 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:10:02,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:10:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1388628246, now seen corresponding path program 1 times [2018-12-02 19:10:02,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:10:02,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:02,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:10:02,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:02,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:10:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:10:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 19:10:03,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:10:03,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 19:10:03,012 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:10:03,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:10:03,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:10:03,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:10:03,013 INFO L87 Difference]: Start difference. First operand 229 states and 247 transitions. Second operand 5 states. [2018-12-02 19:10:03,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:10:03,150 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2018-12-02 19:10:03,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 19:10:03,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 19:10:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:10:03,151 INFO L225 Difference]: With dead ends: 226 [2018-12-02 19:10:03,151 INFO L226 Difference]: Without dead ends: 226 [2018-12-02 19:10:03,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:10:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-02 19:10:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-12-02 19:10:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-02 19:10:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 244 transitions. [2018-12-02 19:10:03,154 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 244 transitions. Word has length 47 [2018-12-02 19:10:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:10:03,154 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 244 transitions. [2018-12-02 19:10:03,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:10:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 244 transitions. [2018-12-02 19:10:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 19:10:03,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:10:03,154 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:10:03,154 INFO L423 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:10:03,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:10:03,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1388628245, now seen corresponding path program 1 times [2018-12-02 19:10:03,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:10:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:03,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:10:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:03,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:10:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:10:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:10:03,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:10:03,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:10:03,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:10:03,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 19:10:03,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 19:10:03,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:10:03,206 INFO L87 Difference]: Start difference. First operand 226 states and 244 transitions. Second operand 6 states. [2018-12-02 19:10:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:10:03,387 INFO L93 Difference]: Finished difference Result 275 states and 293 transitions. [2018-12-02 19:10:03,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 19:10:03,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-02 19:10:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:10:03,388 INFO L225 Difference]: With dead ends: 275 [2018-12-02 19:10:03,388 INFO L226 Difference]: Without dead ends: 275 [2018-12-02 19:10:03,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:10:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-02 19:10:03,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 247. [2018-12-02 19:10:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-02 19:10:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 271 transitions. [2018-12-02 19:10:03,391 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 271 transitions. Word has length 47 [2018-12-02 19:10:03,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:10:03,391 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 271 transitions. [2018-12-02 19:10:03,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 19:10:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 271 transitions. [2018-12-02 19:10:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 19:10:03,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:10:03,392 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:10:03,392 INFO L423 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:10:03,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:10:03,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1860015083, now seen corresponding path program 1 times [2018-12-02 19:10:03,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:10:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:03,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:10:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:03,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:10:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:10:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:10:03,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:10:03,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 19:10:03,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:10:03,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 19:10:03,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 19:10:03,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:10:03,423 INFO L87 Difference]: Start difference. First operand 247 states and 271 transitions. Second operand 6 states. [2018-12-02 19:10:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:10:03,489 INFO L93 Difference]: Finished difference Result 300 states and 324 transitions. [2018-12-02 19:10:03,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 19:10:03,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-02 19:10:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:10:03,490 INFO L225 Difference]: With dead ends: 300 [2018-12-02 19:10:03,490 INFO L226 Difference]: Without dead ends: 297 [2018-12-02 19:10:03,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:10:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-02 19:10:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 254. [2018-12-02 19:10:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-02 19:10:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2018-12-02 19:10:03,493 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 50 [2018-12-02 19:10:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:10:03,493 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2018-12-02 19:10:03,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 19:10:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2018-12-02 19:10:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 19:10:03,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:10:03,494 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:10:03,494 INFO L423 AbstractCegarLoop]: === Iteration 21 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 19:10:03,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:10:03,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1837526797, now seen corresponding path program 1 times [2018-12-02 19:10:03,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:10:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:03,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:10:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:10:03,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:10:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:10:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:10:03,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:10:03,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 19:10:03,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:10:03,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 19:10:03,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 19:10:03,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-02 19:10:03,656 INFO L87 Difference]: Start difference. First operand 254 states and 279 transitions. Second operand 14 states. [2018-12-02 19:10:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:10:04,099 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-02 19:10:04,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 19:10:04,099 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-12-02 19:10:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:10:04,099 INFO L225 Difference]: With dead ends: 44 [2018-12-02 19:10:04,099 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 19:10:04,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-12-02 19:10:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 19:10:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 19:10:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 19:10:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 19:10:04,101 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-12-02 19:10:04,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:10:04,101 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 19:10:04,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 19:10:04,101 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 19:10:04,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 19:10:04,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:10:04 BoogieIcfgContainer [2018-12-02 19:10:04,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 19:10:04,108 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 19:10:04,108 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 19:10:04,108 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 19:10:04,108 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:09:57" (3/4) ... [2018-12-02 19:10:04,112 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 19:10:04,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fail [2018-12-02 19:10:04,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 19:10:04,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_pair [2018-12-02 19:10:04,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_single_node [2018-12-02 19:10:04,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure seq_sort_core [2018-12-02 19:10:04,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_before [2018-12-02 19:10:04,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 19:10:04,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_after [2018-12-02 19:10:04,123 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-12-02 19:10:04,124 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-02 19:10:04,124 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-02 19:10:04,162 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e9f31dce-07c7-4213-9f7a-b14716d52d19/bin-2019/utaipan/witness.graphml [2018-12-02 19:10:04,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 19:10:04,163 INFO L168 Benchmark]: Toolchain (without parser) took 7003.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -104.0 MB). Peak memory consumption was 197.4 MB. Max. memory is 11.5 GB. [2018-12-02 19:10:04,164 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 19:10:04,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. [2018-12-02 19:10:04,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.03 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. [2018-12-02 19:10:04,164 INFO L168 Benchmark]: Boogie Preprocessor took 27.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 19:10:04,164 INFO L168 Benchmark]: RCFGBuilder took 417.35 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: 75.2 MB). Peak memory consumption was 75.2 MB. Max. memory is 11.5 GB. [2018-12-02 19:10:04,164 INFO L168 Benchmark]: TraceAbstraction took 6191.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -24.3 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. [2018-12-02 19:10:04,165 INFO L168 Benchmark]: Witness Printer took 54.63 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-12-02 19:10:04,165 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 290.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.03 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. * Boogie Preprocessor took 27.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 417.35 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: 75.2 MB). Peak memory consumption was 75.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6191.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -24.3 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. * Witness Printer took 54.63 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 644]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 644]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 101 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 272 locations, 101 error locations. SAFE Result, 6.1s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4586 SDtfs, 2042 SDslu, 10287 SDs, 0 SdLazy, 6992 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 487 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 604 ConstructedInterpolants, 0 QuantifiedInterpolants, 137061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 30/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...