./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69e4d0785323ca2fbac076cafe34fff682fc43d2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:12,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:12,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:12,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:12,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:12,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:12,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:12,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:12,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:12,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:12,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:12,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:12,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:12,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:12,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:12,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:12,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:12,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:12,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:12,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:12,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:12,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:12,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:12,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:12,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:12,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:12,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:12,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:12,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:12,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:12,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:12,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:12,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:12,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:12,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:12,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:12,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:12,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:12,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:12,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:12,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:12,552 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:21:12,562 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:12,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:12,563 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:12,563 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:12,564 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:12,564 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:12,564 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:12,564 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:12,564 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:12,565 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:12,565 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:12,565 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:12,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:21:12,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:21:12,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:12,566 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:12,566 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:21:12,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:12,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:12,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:12,567 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:21:12,567 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:21:12,567 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:21:12,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:12,568 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:12,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:12,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:12,569 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:12,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:12,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:12,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:12,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:12,569 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:12,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:12,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:12,570 INFO L138 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_05d92bee-f286-45ec-bc49-27b723cde718/bin/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 69e4d0785323ca2fbac076cafe34fff682fc43d2 [2019-10-22 11:21:12,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:12,603 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:12,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:12,607 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:12,607 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:12,608 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-10-22 11:21:12,663 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/bin/utaipan/data/869738574/7bc60da7faa0435b84f1ca391e47e2e1/FLAG09e316d5e [2019-10-22 11:21:13,080 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:13,081 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-10-22 11:21:13,092 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/bin/utaipan/data/869738574/7bc60da7faa0435b84f1ca391e47e2e1/FLAG09e316d5e [2019-10-22 11:21:13,429 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/bin/utaipan/data/869738574/7bc60da7faa0435b84f1ca391e47e2e1 [2019-10-22 11:21:13,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:13,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:13,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:13,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:13,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:13,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:13" (1/1) ... [2019-10-22 11:21:13,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a61fd4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:13, skipping insertion in model container [2019-10-22 11:21:13,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:13" (1/1) ... [2019-10-22 11:21:13,446 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:13,476 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:13,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:13,787 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:13,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:13,892 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:13,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:13 WrapperNode [2019-10-22 11:21:13,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:13,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:13,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:13,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:13,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:13" (1/1) ... [2019-10-22 11:21:13,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:13" (1/1) ... [2019-10-22 11:21:13,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:13,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:13,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:13,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:13,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:13" (1/1) ... [2019-10-22 11:21:13,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:13" (1/1) ... [2019-10-22 11:21:13,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:13" (1/1) ... [2019-10-22 11:21:13,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:13" (1/1) ... [2019-10-22 11:21:13,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:13" (1/1) ... [2019-10-22 11:21:13,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:13" (1/1) ... [2019-10-22 11:21:13,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:13" (1/1) ... [2019-10-22 11:21:13,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:13,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:13,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:13,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:13,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/bin/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 [2019-10-22 11:21:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:21:14,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:21:14,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:21:14,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:21:14,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:21:14,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:21:14,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:21:14,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:14,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:14,377 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:14,377 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 11:21:14,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:14 BoogieIcfgContainer [2019-10-22 11:21:14,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:14,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:14,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:14,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:14,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:13" (1/3) ... [2019-10-22 11:21:14,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcc66f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:14, skipping insertion in model container [2019-10-22 11:21:14,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:13" (2/3) ... [2019-10-22 11:21:14,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcc66f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:14, skipping insertion in model container [2019-10-22 11:21:14,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:14" (3/3) ... [2019-10-22 11:21:14,386 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019_1-2.i [2019-10-22 11:21:14,397 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:14,403 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2019-10-22 11:21:14,411 INFO L249 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2019-10-22 11:21:14,426 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:14,426 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:21:14,426 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:14,426 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:14,429 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:14,429 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:14,429 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:14,429 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:14,441 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2019-10-22 11:21:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:21:14,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:14,448 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:21:14,450 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:14,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:21:14,459 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:14,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114411220] [2019-10-22 11:21:14,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:14,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:14,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:14,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114411220] [2019-10-22 11:21:14,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:14,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:14,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828033793] [2019-10-22 11:21:14,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:14,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:14,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:14,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:14,634 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2019-10-22 11:21:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:14,736 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-10-22 11:21:14,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:14,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:21:14,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:14,748 INFO L225 Difference]: With dead ends: 64 [2019-10-22 11:21:14,749 INFO L226 Difference]: Without dead ends: 62 [2019-10-22 11:21:14,750 INFO L600 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 [2019-10-22 11:21:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-22 11:21:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-22 11:21:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-22 11:21:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-10-22 11:21:14,784 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 3 [2019-10-22 11:21:14,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:14,785 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-10-22 11:21:14,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-10-22 11:21:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:21:14,785 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:14,785 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:21:14,786 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:14,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:14,786 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-10-22 11:21:14,786 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:14,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421255829] [2019-10-22 11:21:14,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:14,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:14,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:14,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421255829] [2019-10-22 11:21:14,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:14,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:14,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897434107] [2019-10-22 11:21:14,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:14,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:14,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:14,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:14,837 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 3 states. [2019-10-22 11:21:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:14,915 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-10-22 11:21:14,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:14,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:21:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:14,918 INFO L225 Difference]: With dead ends: 61 [2019-10-22 11:21:14,918 INFO L226 Difference]: Without dead ends: 61 [2019-10-22 11:21:14,919 INFO L600 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 [2019-10-22 11:21:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-22 11:21:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-22 11:21:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 11:21:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-10-22 11:21:14,924 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 3 [2019-10-22 11:21:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:14,924 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-10-22 11:21:14,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-10-22 11:21:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 11:21:14,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:14,925 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 11:21:14,925 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:14,925 INFO L82 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2019-10-22 11:21:14,926 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:14,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187770177] [2019-10-22 11:21:14,926 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:14,926 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:14,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:15,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187770177] [2019-10-22 11:21:15,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:15,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:15,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74801569] [2019-10-22 11:21:15,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:15,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:15,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:15,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:15,019 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 5 states. [2019-10-22 11:21:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:15,242 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-10-22 11:21:15,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:15,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-10-22 11:21:15,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:15,243 INFO L225 Difference]: With dead ends: 58 [2019-10-22 11:21:15,243 INFO L226 Difference]: Without dead ends: 58 [2019-10-22 11:21:15,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-22 11:21:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-22 11:21:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 11:21:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-10-22 11:21:15,248 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 5 [2019-10-22 11:21:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:15,250 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-10-22 11:21:15,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-10-22 11:21:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:21:15,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:15,251 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:15,251 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1803024997, now seen corresponding path program 1 times [2019-10-22 11:21:15,252 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:15,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972207588] [2019-10-22 11:21:15,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:15,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:15,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:15,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972207588] [2019-10-22 11:21:15,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:15,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:15,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502567607] [2019-10-22 11:21:15,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:15,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:15,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:15,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:15,326 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 5 states. [2019-10-22 11:21:15,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:15,449 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-10-22 11:21:15,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:15,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-10-22 11:21:15,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:15,450 INFO L225 Difference]: With dead ends: 57 [2019-10-22 11:21:15,450 INFO L226 Difference]: Without dead ends: 57 [2019-10-22 11:21:15,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-22 11:21:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-22 11:21:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-22 11:21:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-10-22 11:21:15,454 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 7 [2019-10-22 11:21:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:15,455 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-10-22 11:21:15,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-10-22 11:21:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:21:15,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:15,455 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:15,456 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:15,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:15,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1803024998, now seen corresponding path program 1 times [2019-10-22 11:21:15,457 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:15,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838806120] [2019-10-22 11:21:15,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:15,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:15,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:15,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838806120] [2019-10-22 11:21:15,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:15,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:15,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548374242] [2019-10-22 11:21:15,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:15,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:15,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:15,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:15,520 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 5 states. [2019-10-22 11:21:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:15,626 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-10-22 11:21:15,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:15,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-10-22 11:21:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:15,627 INFO L225 Difference]: With dead ends: 56 [2019-10-22 11:21:15,627 INFO L226 Difference]: Without dead ends: 56 [2019-10-22 11:21:15,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:15,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-22 11:21:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-10-22 11:21:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-22 11:21:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-10-22 11:21:15,631 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 7 [2019-10-22 11:21:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:15,631 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-10-22 11:21:15,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-10-22 11:21:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:21:15,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:15,632 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:15,633 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:15,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1056667984, now seen corresponding path program 1 times [2019-10-22 11:21:15,633 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:15,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81090200] [2019-10-22 11:21:15,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:15,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:15,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:15,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81090200] [2019-10-22 11:21:15,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:15,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:21:15,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669052866] [2019-10-22 11:21:15,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:21:15,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:15,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:21:15,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:15,776 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 9 states. [2019-10-22 11:21:16,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:16,040 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-10-22 11:21:16,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:21:16,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-10-22 11:21:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:16,042 INFO L225 Difference]: With dead ends: 55 [2019-10-22 11:21:16,042 INFO L226 Difference]: Without dead ends: 55 [2019-10-22 11:21:16,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:21:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-22 11:21:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-22 11:21:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 11:21:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-10-22 11:21:16,047 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 10 [2019-10-22 11:21:16,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:16,047 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-10-22 11:21:16,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:21:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-10-22 11:21:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:21:16,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:16,058 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:16,058 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:16,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1056667985, now seen corresponding path program 1 times [2019-10-22 11:21:16,059 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:16,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091278665] [2019-10-22 11:21:16,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:16,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091278665] [2019-10-22 11:21:16,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:16,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:21:16,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293329734] [2019-10-22 11:21:16,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:21:16,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:16,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:21:16,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:16,215 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 9 states. [2019-10-22 11:21:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:16,447 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-10-22 11:21:16,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:21:16,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-10-22 11:21:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:16,448 INFO L225 Difference]: With dead ends: 54 [2019-10-22 11:21:16,449 INFO L226 Difference]: Without dead ends: 54 [2019-10-22 11:21:16,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:21:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-22 11:21:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-22 11:21:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-22 11:21:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-10-22 11:21:16,452 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 10 [2019-10-22 11:21:16,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:16,453 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-10-22 11:21:16,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:21:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-10-22 11:21:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:21:16,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:16,453 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:16,454 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:16,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:16,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1845650546, now seen corresponding path program 1 times [2019-10-22 11:21:16,454 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:16,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817006803] [2019-10-22 11:21:16,454 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:16,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817006803] [2019-10-22 11:21:16,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:16,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:16,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203749783] [2019-10-22 11:21:16,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:16,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:16,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:16,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:16,545 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 4 states. [2019-10-22 11:21:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:16,616 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-10-22 11:21:16,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:16,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 11:21:16,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:16,617 INFO L225 Difference]: With dead ends: 52 [2019-10-22 11:21:16,617 INFO L226 Difference]: Without dead ends: 52 [2019-10-22 11:21:16,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:16,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-22 11:21:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-10-22 11:21:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-22 11:21:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-10-22 11:21:16,623 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 12 [2019-10-22 11:21:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:16,624 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-10-22 11:21:16,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-10-22 11:21:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:21:16,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:16,625 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:16,625 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:16,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:16,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1845650547, now seen corresponding path program 1 times [2019-10-22 11:21:16,626 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:16,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351490849] [2019-10-22 11:21:16,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:16,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351490849] [2019-10-22 11:21:16,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:16,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:16,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456720435] [2019-10-22 11:21:16,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:16,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:16,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:16,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:16,769 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 6 states. [2019-10-22 11:21:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:16,832 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-10-22 11:21:16,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:16,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-10-22 11:21:16,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:16,833 INFO L225 Difference]: With dead ends: 50 [2019-10-22 11:21:16,833 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 11:21:16,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 11:21:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-22 11:21:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-22 11:21:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-10-22 11:21:16,835 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 12 [2019-10-22 11:21:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:16,835 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-10-22 11:21:16,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-10-22 11:21:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:21:16,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:16,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:16,837 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:16,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:16,838 INFO L82 PathProgramCache]: Analyzing trace with hash -395909395, now seen corresponding path program 1 times [2019-10-22 11:21:16,838 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:16,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118208121] [2019-10-22 11:21:16,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,839 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:16,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118208121] [2019-10-22 11:21:16,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:16,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:16,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234273747] [2019-10-22 11:21:16,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:16,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:16,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:16,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:16,885 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 3 states. [2019-10-22 11:21:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:16,951 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-10-22 11:21:16,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:16,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 11:21:16,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:16,951 INFO L225 Difference]: With dead ends: 46 [2019-10-22 11:21:16,952 INFO L226 Difference]: Without dead ends: 46 [2019-10-22 11:21:16,952 INFO L600 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 [2019-10-22 11:21:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-22 11:21:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-22 11:21:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 11:21:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-10-22 11:21:16,956 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 15 [2019-10-22 11:21:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:16,956 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-10-22 11:21:16,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-10-22 11:21:16,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:21:16,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:16,957 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:16,957 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:16,957 INFO L82 PathProgramCache]: Analyzing trace with hash -395909394, now seen corresponding path program 1 times [2019-10-22 11:21:16,958 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:16,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412613089] [2019-10-22 11:21:16,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:16,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412613089] [2019-10-22 11:21:16,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:16,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:16,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842771376] [2019-10-22 11:21:16,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:16,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:16,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:16,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:16,990 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 3 states. [2019-10-22 11:21:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:17,017 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-10-22 11:21:17,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:17,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 11:21:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:17,018 INFO L225 Difference]: With dead ends: 42 [2019-10-22 11:21:17,018 INFO L226 Difference]: Without dead ends: 42 [2019-10-22 11:21:17,018 INFO L600 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 [2019-10-22 11:21:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-22 11:21:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-22 11:21:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 11:21:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-10-22 11:21:17,020 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 15 [2019-10-22 11:21:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:17,021 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-10-22 11:21:17,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-10-22 11:21:17,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:21:17,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:17,021 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:17,022 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:17,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:17,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1598383955, now seen corresponding path program 1 times [2019-10-22 11:21:17,022 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:17,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074779305] [2019-10-22 11:21:17,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:17,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:17,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:17,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074779305] [2019-10-22 11:21:17,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:17,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-22 11:21:17,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636588956] [2019-10-22 11:21:17,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:21:17,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:17,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:21:17,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:21:17,628 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 15 states. [2019-10-22 11:21:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:18,603 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-10-22 11:21:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 11:21:18,604 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-10-22 11:21:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:18,604 INFO L225 Difference]: With dead ends: 40 [2019-10-22 11:21:18,604 INFO L226 Difference]: Without dead ends: 40 [2019-10-22 11:21:18,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-10-22 11:21:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-22 11:21:18,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-22 11:21:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 11:21:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-10-22 11:21:18,607 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 21 [2019-10-22 11:21:18,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:18,607 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-10-22 11:21:18,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:21:18,607 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-10-22 11:21:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:21:18,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:18,608 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:18,609 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:18,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:18,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1598383954, now seen corresponding path program 1 times [2019-10-22 11:21:18,609 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:18,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015464404] [2019-10-22 11:21:18,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:18,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:18,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:18,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015464404] [2019-10-22 11:21:18,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:18,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-22 11:21:18,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139250260] [2019-10-22 11:21:18,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 11:21:18,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:18,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 11:21:18,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:21:18,943 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 16 states. [2019-10-22 11:21:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:19,515 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-10-22 11:21:19,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 11:21:19,515 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-10-22 11:21:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:19,516 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:21:19,516 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 11:21:19,516 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-10-22 11:21:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 11:21:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-22 11:21:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 11:21:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-10-22 11:21:19,518 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 21 [2019-10-22 11:21:19,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:19,520 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-10-22 11:21:19,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 11:21:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-10-22 11:21:19,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:21:19,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:19,521 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:19,521 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:19,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1989704959, now seen corresponding path program 1 times [2019-10-22 11:21:19,522 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:19,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812190552] [2019-10-22 11:21:19,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:19,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:19,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:19,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812190552] [2019-10-22 11:21:19,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:19,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-22 11:21:19,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370095114] [2019-10-22 11:21:19,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 11:21:19,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:19,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 11:21:19,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:21:19,933 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 16 states. [2019-10-22 11:21:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:20,376 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-10-22 11:21:20,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:21:20,376 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-10-22 11:21:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:20,376 INFO L225 Difference]: With dead ends: 37 [2019-10-22 11:21:20,376 INFO L226 Difference]: Without dead ends: 37 [2019-10-22 11:21:20,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2019-10-22 11:21:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-22 11:21:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-22 11:21:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 11:21:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-10-22 11:21:20,379 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 22 [2019-10-22 11:21:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:20,379 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-10-22 11:21:20,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 11:21:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-10-22 11:21:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:21:20,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:20,379 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:20,379 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:20,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:20,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1989704958, now seen corresponding path program 1 times [2019-10-22 11:21:20,380 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:20,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038490726] [2019-10-22 11:21:20,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:20,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:20,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:20,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038490726] [2019-10-22 11:21:20,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:20,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-22 11:21:20,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936430878] [2019-10-22 11:21:20,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:21:20,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:20,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:21:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:21:20,745 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 15 states. [2019-10-22 11:21:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:21,528 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-10-22 11:21:21,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-22 11:21:21,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-10-22 11:21:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:21,529 INFO L225 Difference]: With dead ends: 35 [2019-10-22 11:21:21,529 INFO L226 Difference]: Without dead ends: 35 [2019-10-22 11:21:21,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2019-10-22 11:21:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-22 11:21:21,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-22 11:21:21,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 11:21:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-10-22 11:21:21,531 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 22 [2019-10-22 11:21:21,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:21,531 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-10-22 11:21:21,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:21:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-10-22 11:21:21,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:21:21,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:21,532 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:21,532 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:21,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:21,533 INFO L82 PathProgramCache]: Analyzing trace with hash -456757128, now seen corresponding path program 1 times [2019-10-22 11:21:21,533 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:21,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360732144] [2019-10-22 11:21:21,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:21,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:21,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:22,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360732144] [2019-10-22 11:21:22,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:22,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-22 11:21:22,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095051652] [2019-10-22 11:21:22,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-22 11:21:22,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:22,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-22 11:21:22,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2019-10-22 11:21:22,051 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 21 states. [2019-10-22 11:21:22,916 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-10-22 11:21:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:23,600 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2019-10-22 11:21:23,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-22 11:21:23,601 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-10-22 11:21:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:23,601 INFO L225 Difference]: With dead ends: 35 [2019-10-22 11:21:23,601 INFO L226 Difference]: Without dead ends: 35 [2019-10-22 11:21:23,608 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2019-10-22 11:21:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-22 11:21:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-22 11:21:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 11:21:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2019-10-22 11:21:23,610 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 25 [2019-10-22 11:21:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:23,610 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2019-10-22 11:21:23,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-22 11:21:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2019-10-22 11:21:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:21:23,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:23,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:23,611 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:23,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:23,611 INFO L82 PathProgramCache]: Analyzing trace with hash -456755591, now seen corresponding path program 1 times [2019-10-22 11:21:23,612 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:23,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659026196] [2019-10-22 11:21:23,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:23,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:23,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:23,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659026196] [2019-10-22 11:21:23,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:23,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-22 11:21:23,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596361368] [2019-10-22 11:21:23,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:21:23,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:23,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:21:23,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:21:23,880 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand 15 states. [2019-10-22 11:21:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:24,361 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2019-10-22 11:21:24,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 11:21:24,361 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-10-22 11:21:24,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:24,361 INFO L225 Difference]: With dead ends: 34 [2019-10-22 11:21:24,361 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:21:24,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2019-10-22 11:21:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:21:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:21:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:21:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2019-10-22 11:21:24,363 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 25 [2019-10-22 11:21:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:24,363 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2019-10-22 11:21:24,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:21:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2019-10-22 11:21:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:21:24,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:24,364 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:24,364 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:24,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:24,365 INFO L82 PathProgramCache]: Analyzing trace with hash -749326331, now seen corresponding path program 1 times [2019-10-22 11:21:24,365 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:24,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000181087] [2019-10-22 11:21:24,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:24,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:24,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:24,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000181087] [2019-10-22 11:21:24,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:24,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-22 11:21:24,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746499763] [2019-10-22 11:21:24,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:21:24,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:24,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:21:24,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:21:24,677 INFO L87 Difference]: Start difference. First operand 34 states and 33 transitions. Second operand 15 states. [2019-10-22 11:21:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:25,198 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2019-10-22 11:21:25,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 11:21:25,198 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-10-22 11:21:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:25,198 INFO L225 Difference]: With dead ends: 33 [2019-10-22 11:21:25,198 INFO L226 Difference]: Without dead ends: 33 [2019-10-22 11:21:25,199 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-10-22 11:21:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-22 11:21:25,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-22 11:21:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 11:21:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2019-10-22 11:21:25,200 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 28 [2019-10-22 11:21:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:25,200 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2019-10-22 11:21:25,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:21:25,200 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2019-10-22 11:21:25,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:21:25,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:25,201 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:25,201 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:25,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:25,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1754279683, now seen corresponding path program 1 times [2019-10-22 11:21:25,201 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:25,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486858764] [2019-10-22 11:21:25,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:25,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:25,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:25,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486858764] [2019-10-22 11:21:25,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:25,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-10-22 11:21:25,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137040354] [2019-10-22 11:21:25,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-22 11:21:25,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:25,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-22 11:21:25,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-10-22 11:21:25,719 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand 21 states. [2019-10-22 11:21:26,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:26,523 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2019-10-22 11:21:26,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-22 11:21:26,523 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-10-22 11:21:26,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:26,523 INFO L225 Difference]: With dead ends: 32 [2019-10-22 11:21:26,523 INFO L226 Difference]: Without dead ends: 32 [2019-10-22 11:21:26,524 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=1249, Unknown=0, NotChecked=0, Total=1482 [2019-10-22 11:21:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-22 11:21:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-22 11:21:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 11:21:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 31 transitions. [2019-10-22 11:21:26,525 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 31 transitions. Word has length 29 [2019-10-22 11:21:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:26,525 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 31 transitions. [2019-10-22 11:21:26,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-22 11:21:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 31 transitions. [2019-10-22 11:21:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:21:26,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:26,526 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:26,526 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2019-10-22 11:21:26,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:26,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2059375168, now seen corresponding path program 1 times [2019-10-22 11:21:26,527 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:26,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991873641] [2019-10-22 11:21:26,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:26,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:26,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:27,022 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 40 [2019-10-22 11:21:27,193 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 41 [2019-10-22 11:21:27,375 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 43 [2019-10-22 11:21:27,594 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 44 [2019-10-22 11:21:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:28,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991873641] [2019-10-22 11:21:28,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:28,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-22 11:21:28,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419042393] [2019-10-22 11:21:28,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-22 11:21:28,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:28,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-22 11:21:28,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:21:28,585 INFO L87 Difference]: Start difference. First operand 32 states and 31 transitions. Second operand 22 states. [2019-10-22 11:21:29,757 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 56 [2019-10-22 11:21:30,098 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-10-22 11:21:30,513 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-10-22 11:21:30,736 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-10-22 11:21:31,037 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2019-10-22 11:21:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:31,150 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2019-10-22 11:21:31,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-22 11:21:31,150 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-10-22 11:21:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:31,150 INFO L225 Difference]: With dead ends: 31 [2019-10-22 11:21:31,150 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:21:31,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=179, Invalid=1303, Unknown=0, NotChecked=0, Total=1482 [2019-10-22 11:21:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:21:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:21:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:21:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:21:31,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-10-22 11:21:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:31,151 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:21:31,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-22 11:21:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:21:31,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:21:31,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:31 BoogieIcfgContainer [2019-10-22 11:21:31,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:31,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:31,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:31,157 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:31,158 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:14" (3/4) ... [2019-10-22 11:21:31,161 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:21:31,172 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-10-22 11:21:31,173 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-10-22 11:21:31,173 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:21:31,217 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_05d92bee-f286-45ec-bc49-27b723cde718/bin/utaipan/witness.graphml [2019-10-22 11:21:31,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:31,218 INFO L168 Benchmark]: Toolchain (without parser) took 17786.32 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 460.8 MB). Free memory was 939.1 MB in the beginning and 903.3 MB in the end (delta: 35.8 MB). Peak memory consumption was 496.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:31,219 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:31,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:31,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:31,220 INFO L168 Benchmark]: Boogie Preprocessor took 32.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:31,220 INFO L168 Benchmark]: RCFGBuilder took 408.36 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: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:31,221 INFO L168 Benchmark]: TraceAbstraction took 16777.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 303.6 MB). Free memory was 1.1 GB in the beginning and 907.9 MB in the end (delta: 186.8 MB). Peak memory consumption was 490.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:31,221 INFO L168 Benchmark]: Witness Printer took 59.99 ms. Allocated memory is still 1.5 GB. Free memory was 907.9 MB in the beginning and 903.3 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:31,223 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 459.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 408.36 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: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16777.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 303.6 MB). Free memory was 1.1 GB in the beginning and 907.9 MB in the end (delta: 186.8 MB). Peak memory consumption was 490.3 MB. Max. memory is 11.5 GB. * Witness Printer took 59.99 ms. Allocated memory is still 1.5 GB. Free memory was 907.9 MB in the beginning and 903.3 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 525]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 525]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 529]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 35 error locations. Result: SAFE, OverallTime: 16.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 477 SDtfs, 1293 SDslu, 1066 SDs, 0 SdLazy, 3224 SolverSat, 388 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 139786 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...