./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19-1.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_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/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 72d82df7d97aedab3c94a3eb173a5c41df708a8b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:24:22,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:22,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:22,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:22,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:22,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:22,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:22,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:22,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:22,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:22,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:22,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:22,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:22,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:22,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:22,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:22,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:22,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:22,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:22,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:22,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:22,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:22,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:22,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:22,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:22,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:22,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:22,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:22,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:22,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:22,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:22,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:22,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:22,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:22,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:22,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:22,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:22,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:22,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:22,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:22,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:22,771 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:24:22,784 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:22,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:22,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:22,788 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:22,788 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:22,789 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:22,789 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:22,789 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:22,789 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:22,789 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:22,789 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:22,789 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:22,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:24:22,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:24:22,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:22,790 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:22,790 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:24:22,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:22,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:22,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:22,791 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:24:22,791 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:24:22,791 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:24:22,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:22,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:22,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:22,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:22,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:22,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:22,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:22,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:22,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:22,792 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:22,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:22,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:22,793 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_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/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 -> 72d82df7d97aedab3c94a3eb173a5c41df708a8b [2019-10-22 11:24:22,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:22,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:22,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:22,832 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:22,833 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:22,833 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test19-1.i [2019-10-22 11:24:22,886 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/bin/utaipan/data/c57cdd93f/e1e02db165c542568a6e522739b44522/FLAG2a8c73672 [2019-10-22 11:24:23,377 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:23,377 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/sv-benchmarks/c/ldv-memsafety/memleaks_test19-1.i [2019-10-22 11:24:23,390 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/bin/utaipan/data/c57cdd93f/e1e02db165c542568a6e522739b44522/FLAG2a8c73672 [2019-10-22 11:24:23,680 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/bin/utaipan/data/c57cdd93f/e1e02db165c542568a6e522739b44522 [2019-10-22 11:24:23,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:23,684 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:23,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:23,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:23,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:23,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:23" (1/1) ... [2019-10-22 11:24:23,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7063f609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:23, skipping insertion in model container [2019-10-22 11:24:23,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:23" (1/1) ... [2019-10-22 11:24:23,696 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:23,737 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:24,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:24,165 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:24,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:24,304 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:24,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:24 WrapperNode [2019-10-22 11:24:24,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:24,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:24,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:24,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:24,313 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:24:24" (1/1) ... [2019-10-22 11:24:24,331 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:24:24" (1/1) ... [2019-10-22 11:24:24,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:24,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:24,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:24,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:24,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:24" (1/1) ... [2019-10-22 11:24:24,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:24" (1/1) ... [2019-10-22 11:24:24,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:24" (1/1) ... [2019-10-22 11:24:24,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:24" (1/1) ... [2019-10-22 11:24:24,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:24" (1/1) ... [2019-10-22 11:24:24,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:24" (1/1) ... [2019-10-22 11:24:24,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:24" (1/1) ... [2019-10-22 11:24:24,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:24,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:24,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:24,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:24,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/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:24:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:24:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:24:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:24:24,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:24:24,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:24,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:24:24,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:24,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:24,806 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:24,806 INFO L284 CfgBuilder]: Removed 22 assume(true) statements. [2019-10-22 11:24:24,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:24 BoogieIcfgContainer [2019-10-22 11:24:24,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:24,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:24,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:24,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:24,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:23" (1/3) ... [2019-10-22 11:24:24,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e33a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:24, skipping insertion in model container [2019-10-22 11:24:24,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:24" (2/3) ... [2019-10-22 11:24:24,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e33a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:24, skipping insertion in model container [2019-10-22 11:24:24,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:24" (3/3) ... [2019-10-22 11:24:24,815 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test19-1.i [2019-10-22 11:24:24,822 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:24,828 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-10-22 11:24:24,837 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-10-22 11:24:24,854 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:24,855 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:24:24,855 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:24,855 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:24,855 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:24,855 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:24,855 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:24,855 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-10-22 11:24:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 11:24:24,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:24,879 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 11:24:24,880 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:24,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:24,886 INFO L82 PathProgramCache]: Analyzing trace with hash 28693828, now seen corresponding path program 1 times [2019-10-22 11:24:24,894 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:24,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255270507] [2019-10-22 11:24:24,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:24,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:24,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:25,043 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:24:25,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255270507] [2019-10-22 11:24:25,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:25,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:25,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477617018] [2019-10-22 11:24:25,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:25,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:25,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:25,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:25,067 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2019-10-22 11:24:25,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:25,174 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2019-10-22 11:24:25,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:25,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-10-22 11:24:25,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:25,188 INFO L225 Difference]: With dead ends: 84 [2019-10-22 11:24:25,188 INFO L226 Difference]: Without dead ends: 82 [2019-10-22 11:24:25,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-22 11:24:25,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2019-10-22 11:24:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 11:24:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-10-22 11:24:25,232 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 5 [2019-10-22 11:24:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:25,233 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-10-22 11:24:25,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-10-22 11:24:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 11:24:25,233 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:25,233 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 11:24:25,234 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:25,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:25,236 INFO L82 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2019-10-22 11:24:25,237 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:25,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190341698] [2019-10-22 11:24:25,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:25,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:25,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:25,349 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:24:25,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190341698] [2019-10-22 11:24:25,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:25,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:25,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321378142] [2019-10-22 11:24:25,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:25,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:25,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:25,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:25,353 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 4 states. [2019-10-22 11:24:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:25,470 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2019-10-22 11:24:25,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:25,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-10-22 11:24:25,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:25,472 INFO L225 Difference]: With dead ends: 78 [2019-10-22 11:24:25,472 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 11:24:25,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:24:25,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 11:24:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2019-10-22 11:24:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 11:24:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-10-22 11:24:25,482 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 5 [2019-10-22 11:24:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:25,482 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-10-22 11:24:25,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-10-22 11:24:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:24:25,483 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:25,483 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:25,483 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:25,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1534998135, now seen corresponding path program 1 times [2019-10-22 11:24:25,484 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:25,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623796004] [2019-10-22 11:24:25,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:25,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:25,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:25,584 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:24:25,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623796004] [2019-10-22 11:24:25,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:25,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:25,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193853619] [2019-10-22 11:24:25,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:25,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:25,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:25,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:25,586 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 4 states. [2019-10-22 11:24:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:25,687 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-10-22 11:24:25,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:25,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-22 11:24:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:25,688 INFO L225 Difference]: With dead ends: 94 [2019-10-22 11:24:25,689 INFO L226 Difference]: Without dead ends: 94 [2019-10-22 11:24:25,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-22 11:24:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-10-22 11:24:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-22 11:24:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-10-22 11:24:25,694 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 11 [2019-10-22 11:24:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:25,694 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-10-22 11:24:25,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-10-22 11:24:25,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:24:25,695 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:25,695 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:25,695 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:25,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1534998134, now seen corresponding path program 1 times [2019-10-22 11:24:25,696 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:25,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853873410] [2019-10-22 11:24:25,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:25,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:25,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:25,788 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:24:25,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853873410] [2019-10-22 11:24:25,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:25,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:25,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181918525] [2019-10-22 11:24:25,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:25,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:25,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:25,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:25,789 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 7 states. [2019-10-22 11:24:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:26,054 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2019-10-22 11:24:26,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:26,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-10-22 11:24:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:26,056 INFO L225 Difference]: With dead ends: 104 [2019-10-22 11:24:26,056 INFO L226 Difference]: Without dead ends: 104 [2019-10-22 11:24:26,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:24:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-22 11:24:26,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 61. [2019-10-22 11:24:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 11:24:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2019-10-22 11:24:26,069 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 11 [2019-10-22 11:24:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:26,069 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2019-10-22 11:24:26,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:24:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2019-10-22 11:24:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:24:26,070 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:26,070 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:26,071 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash -340488557, now seen corresponding path program 1 times [2019-10-22 11:24:26,071 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:26,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354327788] [2019-10-22 11:24:26,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:26,162 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:24:26,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354327788] [2019-10-22 11:24:26,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:26,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:26,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576779928] [2019-10-22 11:24:26,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:26,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:26,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:26,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:26,164 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2019-10-22 11:24:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:26,281 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-10-22 11:24:26,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:26,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-10-22 11:24:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:26,282 INFO L225 Difference]: With dead ends: 73 [2019-10-22 11:24:26,283 INFO L226 Difference]: Without dead ends: 73 [2019-10-22 11:24:26,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-22 11:24:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2019-10-22 11:24:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 11:24:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-10-22 11:24:26,287 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 12 [2019-10-22 11:24:26,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:26,287 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-10-22 11:24:26,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-10-22 11:24:26,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:24:26,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:26,288 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:26,289 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:26,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:26,289 INFO L82 PathProgramCache]: Analyzing trace with hash -340488556, now seen corresponding path program 1 times [2019-10-22 11:24:26,289 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:26,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227659953] [2019-10-22 11:24:26,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:26,328 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:24:26,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227659953] [2019-10-22 11:24:26,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:26,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:26,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957147421] [2019-10-22 11:24:26,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:26,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:26,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:26,330 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 5 states. [2019-10-22 11:24:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:26,365 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2019-10-22 11:24:26,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:26,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-22 11:24:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:26,367 INFO L225 Difference]: With dead ends: 70 [2019-10-22 11:24:26,367 INFO L226 Difference]: Without dead ends: 70 [2019-10-22 11:24:26,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-22 11:24:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-10-22 11:24:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 11:24:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2019-10-22 11:24:26,371 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 12 [2019-10-22 11:24:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:26,372 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-10-22 11:24:26,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2019-10-22 11:24:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:24:26,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:26,372 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:26,373 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:26,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:26,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1965188741, now seen corresponding path program 1 times [2019-10-22 11:24:26,374 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:26,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480570809] [2019-10-22 11:24:26,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:26,456 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:24:26,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480570809] [2019-10-22 11:24:26,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:26,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:26,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566521618] [2019-10-22 11:24:26,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:26,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:26,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:26,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:26,458 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 6 states. [2019-10-22 11:24:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:26,556 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2019-10-22 11:24:26,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:26,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-22 11:24:26,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:26,559 INFO L225 Difference]: With dead ends: 132 [2019-10-22 11:24:26,559 INFO L226 Difference]: Without dead ends: 132 [2019-10-22 11:24:26,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:26,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-22 11:24:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 72. [2019-10-22 11:24:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:24:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2019-10-22 11:24:26,574 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 13 [2019-10-22 11:24:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:26,574 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-10-22 11:24:26,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2019-10-22 11:24:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:24:26,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:26,575 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:26,575 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:26,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:26,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1264124163, now seen corresponding path program 1 times [2019-10-22 11:24:26,576 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:26,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781916929] [2019-10-22 11:24:26,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:26,629 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:24:26,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781916929] [2019-10-22 11:24:26,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:26,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:26,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462146089] [2019-10-22 11:24:26,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:26,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:26,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:26,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:26,631 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 4 states. [2019-10-22 11:24:26,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:26,717 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-22 11:24:26,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:26,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-22 11:24:26,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:26,718 INFO L225 Difference]: With dead ends: 111 [2019-10-22 11:24:26,718 INFO L226 Difference]: Without dead ends: 106 [2019-10-22 11:24:26,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-22 11:24:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2019-10-22 11:24:26,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-22 11:24:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2019-10-22 11:24:26,723 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 13 [2019-10-22 11:24:26,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:26,723 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2019-10-22 11:24:26,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2019-10-22 11:24:26,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:24:26,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:26,724 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:26,724 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:26,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:26,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1266452547, now seen corresponding path program 1 times [2019-10-22 11:24:26,725 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:26,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093438443] [2019-10-22 11:24:26,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:26,752 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:24:26,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093438443] [2019-10-22 11:24:26,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:26,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:26,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279589425] [2019-10-22 11:24:26,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:26,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:26,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:26,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:26,754 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 4 states. [2019-10-22 11:24:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:26,774 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2019-10-22 11:24:26,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:26,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-22 11:24:26,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:26,776 INFO L225 Difference]: With dead ends: 174 [2019-10-22 11:24:26,776 INFO L226 Difference]: Without dead ends: 174 [2019-10-22 11:24:26,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:26,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-22 11:24:26,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 85. [2019-10-22 11:24:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 11:24:26,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-10-22 11:24:26,780 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 18 [2019-10-22 11:24:26,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:26,781 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-10-22 11:24:26,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2019-10-22 11:24:26,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:24:26,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:26,781 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:26,782 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:26,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:26,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1268299589, now seen corresponding path program 1 times [2019-10-22 11:24:26,783 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:26,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484135849] [2019-10-22 11:24:26,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:26,840 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:24:26,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484135849] [2019-10-22 11:24:26,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:26,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:26,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474664015] [2019-10-22 11:24:26,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:26,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:26,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:26,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:26,842 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 6 states. [2019-10-22 11:24:26,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:26,942 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2019-10-22 11:24:26,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:26,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-22 11:24:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:26,943 INFO L225 Difference]: With dead ends: 139 [2019-10-22 11:24:26,943 INFO L226 Difference]: Without dead ends: 139 [2019-10-22 11:24:26,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:26,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-22 11:24:26,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 90. [2019-10-22 11:24:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-22 11:24:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2019-10-22 11:24:26,948 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 18 [2019-10-22 11:24:26,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:26,948 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2019-10-22 11:24:26,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2019-10-22 11:24:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:24:26,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:26,950 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:26,950 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:26,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:26,951 INFO L82 PathProgramCache]: Analyzing trace with hash 875272579, now seen corresponding path program 1 times [2019-10-22 11:24:26,951 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:26,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006208277] [2019-10-22 11:24:26,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:27,113 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:24:27,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006208277] [2019-10-22 11:24:27,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:27,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:24:27,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019132473] [2019-10-22 11:24:27,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:24:27,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:27,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:24:27,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:27,115 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 10 states. [2019-10-22 11:24:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:27,319 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-10-22 11:24:27,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:24:27,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-10-22 11:24:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:27,320 INFO L225 Difference]: With dead ends: 89 [2019-10-22 11:24:27,320 INFO L226 Difference]: Without dead ends: 89 [2019-10-22 11:24:27,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:24:27,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-22 11:24:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-10-22 11:24:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 11:24:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2019-10-22 11:24:27,323 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 18 [2019-10-22 11:24:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:27,323 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2019-10-22 11:24:27,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:24:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2019-10-22 11:24:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:24:27,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:27,324 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:27,324 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:27,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:27,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1363646277, now seen corresponding path program 1 times [2019-10-22 11:24:27,325 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:27,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384993397] [2019-10-22 11:24:27,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:27,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:27,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:27,468 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:24:27,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384993397] [2019-10-22 11:24:27,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:27,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:24:27,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877192405] [2019-10-22 11:24:27,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:24:27,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:27,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:24:27,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:27,470 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 10 states. [2019-10-22 11:24:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:27,822 INFO L93 Difference]: Finished difference Result 231 states and 249 transitions. [2019-10-22 11:24:27,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:24:27,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-10-22 11:24:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:27,824 INFO L225 Difference]: With dead ends: 231 [2019-10-22 11:24:27,824 INFO L226 Difference]: Without dead ends: 231 [2019-10-22 11:24:27,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:24:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-22 11:24:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 107. [2019-10-22 11:24:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-22 11:24:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2019-10-22 11:24:27,828 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 19 [2019-10-22 11:24:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:27,829 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2019-10-22 11:24:27,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:24:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2019-10-22 11:24:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:24:27,829 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:27,830 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:27,830 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:27,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:27,831 INFO L82 PathProgramCache]: Analyzing trace with hash -224701625, now seen corresponding path program 1 times [2019-10-22 11:24:27,831 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:27,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964723333] [2019-10-22 11:24:27,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:27,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:27,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:27,876 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:24:27,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964723333] [2019-10-22 11:24:27,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:27,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:27,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349073967] [2019-10-22 11:24:27,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:27,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:27,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:27,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:27,877 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 6 states. [2019-10-22 11:24:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:27,961 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2019-10-22 11:24:27,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:27,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-22 11:24:27,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:27,963 INFO L225 Difference]: With dead ends: 121 [2019-10-22 11:24:27,963 INFO L226 Difference]: Without dead ends: 116 [2019-10-22 11:24:27,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:27,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-22 11:24:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 69. [2019-10-22 11:24:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 11:24:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-10-22 11:24:27,965 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 19 [2019-10-22 11:24:27,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:27,966 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-10-22 11:24:27,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-10-22 11:24:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:24:27,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:27,968 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] [2019-10-22 11:24:27,969 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1586417447, now seen corresponding path program 1 times [2019-10-22 11:24:27,969 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:27,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771714974] [2019-10-22 11:24:27,969 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:27,969 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:27,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:28,027 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:24:28,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771714974] [2019-10-22 11:24:28,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:28,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:28,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912626997] [2019-10-22 11:24:28,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:28,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:28,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:28,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:28,029 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2019-10-22 11:24:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:28,111 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2019-10-22 11:24:28,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:28,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-22 11:24:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:28,112 INFO L225 Difference]: With dead ends: 76 [2019-10-22 11:24:28,112 INFO L226 Difference]: Without dead ends: 76 [2019-10-22 11:24:28,112 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-22 11:24:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2019-10-22 11:24:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 11:24:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2019-10-22 11:24:28,114 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 20 [2019-10-22 11:24:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:28,114 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2019-10-22 11:24:28,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2019-10-22 11:24:28,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:24:28,115 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:28,115 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] [2019-10-22 11:24:28,115 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:28,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:28,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1586417448, now seen corresponding path program 1 times [2019-10-22 11:24:28,116 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:28,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341028983] [2019-10-22 11:24:28,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:28,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:28,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:28,182 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:24:28,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341028983] [2019-10-22 11:24:28,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:28,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:28,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712244689] [2019-10-22 11:24:28,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:28,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:28,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:28,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:28,184 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 7 states. [2019-10-22 11:24:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:28,243 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2019-10-22 11:24:28,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:28,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-22 11:24:28,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:28,244 INFO L225 Difference]: With dead ends: 86 [2019-10-22 11:24:28,244 INFO L226 Difference]: Without dead ends: 86 [2019-10-22 11:24:28,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:28,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-22 11:24:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-10-22 11:24:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 11:24:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2019-10-22 11:24:28,246 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 20 [2019-10-22 11:24:28,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:28,247 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2019-10-22 11:24:28,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:24:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2019-10-22 11:24:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:24:28,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:28,248 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] [2019-10-22 11:24:28,248 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:28,248 INFO L82 PathProgramCache]: Analyzing trace with hash -676638267, now seen corresponding path program 1 times [2019-10-22 11:24:28,248 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:28,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414206831] [2019-10-22 11:24:28,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:28,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:28,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:28,347 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:24:28,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414206831] [2019-10-22 11:24:28,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:28,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:24:28,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226991047] [2019-10-22 11:24:28,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:24:28,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:28,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:24:28,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:28,348 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 9 states. [2019-10-22 11:24:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:28,560 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2019-10-22 11:24:28,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:24:28,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-22 11:24:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:28,561 INFO L225 Difference]: With dead ends: 101 [2019-10-22 11:24:28,562 INFO L226 Difference]: Without dead ends: 101 [2019-10-22 11:24:28,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:24:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-22 11:24:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2019-10-22 11:24:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 11:24:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-10-22 11:24:28,564 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 20 [2019-10-22 11:24:28,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:28,564 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-10-22 11:24:28,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:24:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-10-22 11:24:28,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:24:28,565 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:28,565 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:24:28,565 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:28,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1934300630, now seen corresponding path program 1 times [2019-10-22 11:24:28,565 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:28,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242598417] [2019-10-22 11:24:28,566 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:28,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:28,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:28,653 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:24:28,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242598417] [2019-10-22 11:24:28,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:28,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:24:28,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436505721] [2019-10-22 11:24:28,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:24:28,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:28,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:24:28,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:28,655 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2019-10-22 11:24:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:28,791 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-10-22 11:24:28,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:24:28,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-10-22 11:24:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:28,792 INFO L225 Difference]: With dead ends: 84 [2019-10-22 11:24:28,792 INFO L226 Difference]: Without dead ends: 84 [2019-10-22 11:24:28,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:24:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-22 11:24:28,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2019-10-22 11:24:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 11:24:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-10-22 11:24:28,795 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 21 [2019-10-22 11:24:28,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:28,795 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-10-22 11:24:28,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:24:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-10-22 11:24:28,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:24:28,796 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:28,796 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:24:28,796 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:28,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:28,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1934384108, now seen corresponding path program 1 times [2019-10-22 11:24:28,797 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:28,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701696644] [2019-10-22 11:24:28,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:28,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:28,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:28,905 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:24:28,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701696644] [2019-10-22 11:24:28,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:28,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:28,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429940416] [2019-10-22 11:24:28,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:24:28,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:28,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:24:28,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:28,907 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 8 states. [2019-10-22 11:24:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:29,054 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-10-22 11:24:29,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:29,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-10-22 11:24:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:29,055 INFO L225 Difference]: With dead ends: 78 [2019-10-22 11:24:29,055 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 11:24:29,056 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:24:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 11:24:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2019-10-22 11:24:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 11:24:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-10-22 11:24:29,058 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 21 [2019-10-22 11:24:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:29,058 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-10-22 11:24:29,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:24:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-10-22 11:24:29,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:29,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:29,059 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:24:29,059 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:29,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:29,060 INFO L82 PathProgramCache]: Analyzing trace with hash -166222521, now seen corresponding path program 1 times [2019-10-22 11:24:29,060 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:29,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506186396] [2019-10-22 11:24:29,060 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:29,060 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:29,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:29,137 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:24:29,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506186396] [2019-10-22 11:24:29,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:29,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:24:29,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088708422] [2019-10-22 11:24:29,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:24:29,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:29,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:24:29,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:29,138 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 9 states. [2019-10-22 11:24:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:29,401 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-10-22 11:24:29,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:24:29,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-10-22 11:24:29,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:29,403 INFO L225 Difference]: With dead ends: 119 [2019-10-22 11:24:29,403 INFO L226 Difference]: Without dead ends: 119 [2019-10-22 11:24:29,403 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:24:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-22 11:24:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 76. [2019-10-22 11:24:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 11:24:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-10-22 11:24:29,405 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 22 [2019-10-22 11:24:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:29,406 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-10-22 11:24:29,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:24:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-10-22 11:24:29,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:29,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:29,407 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:24:29,407 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:29,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash -163634771, now seen corresponding path program 1 times [2019-10-22 11:24:29,407 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:29,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751862274] [2019-10-22 11:24:29,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:29,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:29,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:29,610 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:24:29,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751862274] [2019-10-22 11:24:29,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:29,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-22 11:24:29,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107692216] [2019-10-22 11:24:29,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:24:29,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:29,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:24:29,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:24:29,611 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 12 states. [2019-10-22 11:24:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:29,851 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-10-22 11:24:29,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:24:29,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-10-22 11:24:29,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:29,851 INFO L225 Difference]: With dead ends: 78 [2019-10-22 11:24:29,851 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 11:24:29,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:24:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 11:24:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-10-22 11:24:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 11:24:29,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-10-22 11:24:29,853 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 22 [2019-10-22 11:24:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:29,854 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-10-22 11:24:29,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:24:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-10-22 11:24:29,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:29,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:29,854 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:24:29,855 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:29,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:29,855 INFO L82 PathProgramCache]: Analyzing trace with hash -163612893, now seen corresponding path program 1 times [2019-10-22 11:24:29,855 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:29,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100203550] [2019-10-22 11:24:29,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:29,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:29,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:29,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:24:29,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100203550] [2019-10-22 11:24:29,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:29,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:29,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194494529] [2019-10-22 11:24:29,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:29,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:29,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:29,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:29,881 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 4 states. [2019-10-22 11:24:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:29,895 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2019-10-22 11:24:29,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:29,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-22 11:24:29,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:29,895 INFO L225 Difference]: With dead ends: 95 [2019-10-22 11:24:29,896 INFO L226 Difference]: Without dead ends: 95 [2019-10-22 11:24:29,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-22 11:24:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2019-10-22 11:24:29,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 11:24:29,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-10-22 11:24:29,898 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2019-10-22 11:24:29,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:29,898 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-10-22 11:24:29,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-10-22 11:24:29,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:29,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:29,899 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:24:29,899 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:29,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:29,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1177339771, now seen corresponding path program 1 times [2019-10-22 11:24:29,900 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:29,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424874460] [2019-10-22 11:24:29,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:29,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:29,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:29,938 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:24:29,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424874460] [2019-10-22 11:24:29,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:29,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:29,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115356272] [2019-10-22 11:24:29,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:29,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:29,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:29,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:29,939 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 6 states. [2019-10-22 11:24:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:30,022 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2019-10-22 11:24:30,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:30,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-22 11:24:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:30,023 INFO L225 Difference]: With dead ends: 106 [2019-10-22 11:24:30,023 INFO L226 Difference]: Without dead ends: 106 [2019-10-22 11:24:30,024 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-22 11:24:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 73. [2019-10-22 11:24:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 11:24:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-22 11:24:30,026 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 22 [2019-10-22 11:24:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:30,026 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-22 11:24:30,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-22 11:24:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:30,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:30,026 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:24:30,027 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:30,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:30,027 INFO L82 PathProgramCache]: Analyzing trace with hash -497281401, now seen corresponding path program 1 times [2019-10-22 11:24:30,027 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:30,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361638926] [2019-10-22 11:24:30,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:30,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:30,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:30,059 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:24:30,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361638926] [2019-10-22 11:24:30,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:30,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:30,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077388863] [2019-10-22 11:24:30,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:30,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:30,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:30,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:30,061 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2019-10-22 11:24:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:30,078 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-10-22 11:24:30,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:30,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-22 11:24:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:30,080 INFO L225 Difference]: With dead ends: 88 [2019-10-22 11:24:30,080 INFO L226 Difference]: Without dead ends: 88 [2019-10-22 11:24:30,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-22 11:24:30,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2019-10-22 11:24:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 11:24:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-10-22 11:24:30,082 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 22 [2019-10-22 11:24:30,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:30,082 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-10-22 11:24:30,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-10-22 11:24:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:24:30,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:30,083 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] [2019-10-22 11:24:30,083 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:30,083 INFO L82 PathProgramCache]: Analyzing trace with hash -857930760, now seen corresponding path program 1 times [2019-10-22 11:24:30,083 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:30,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701539686] [2019-10-22 11:24:30,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:30,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:30,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:30,148 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:24:30,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701539686] [2019-10-22 11:24:30,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:30,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:24:30,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702285936] [2019-10-22 11:24:30,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:24:30,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:30,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:24:30,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:30,150 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 9 states. [2019-10-22 11:24:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:30,295 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-10-22 11:24:30,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:24:30,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-10-22 11:24:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:30,296 INFO L225 Difference]: With dead ends: 70 [2019-10-22 11:24:30,296 INFO L226 Difference]: Without dead ends: 70 [2019-10-22 11:24:30,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:24:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-22 11:24:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-10-22 11:24:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 11:24:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-10-22 11:24:30,298 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 23 [2019-10-22 11:24:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:30,298 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-10-22 11:24:30,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:24:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-10-22 11:24:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:24:30,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:30,298 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] [2019-10-22 11:24:30,299 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:30,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:30,299 INFO L82 PathProgramCache]: Analyzing trace with hash -777710485, now seen corresponding path program 1 times [2019-10-22 11:24:30,299 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:30,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366368930] [2019-10-22 11:24:30,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:30,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:30,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:30,521 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:24:30,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366368930] [2019-10-22 11:24:30,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:30,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-22 11:24:30,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702108038] [2019-10-22 11:24:30,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:24:30,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:30,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:24:30,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:24:30,523 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 12 states. [2019-10-22 11:24:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:30,818 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2019-10-22 11:24:30,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:24:30,818 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-10-22 11:24:30,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:30,819 INFO L225 Difference]: With dead ends: 87 [2019-10-22 11:24:30,819 INFO L226 Difference]: Without dead ends: 87 [2019-10-22 11:24:30,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-10-22 11:24:30,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-22 11:24:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2019-10-22 11:24:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-22 11:24:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-10-22 11:24:30,821 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 23 [2019-10-22 11:24:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:30,821 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-10-22 11:24:30,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:24:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-10-22 11:24:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:24:30,821 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:30,821 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] [2019-10-22 11:24:30,822 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:30,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:30,822 INFO L82 PathProgramCache]: Analyzing trace with hash -826049684, now seen corresponding path program 1 times [2019-10-22 11:24:30,822 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:30,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170990922] [2019-10-22 11:24:30,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:30,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:30,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:30,912 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:24:30,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170990922] [2019-10-22 11:24:30,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:30,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:24:30,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667475994] [2019-10-22 11:24:30,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:24:30,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:30,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:24:30,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:30,913 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 10 states. [2019-10-22 11:24:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:31,084 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-10-22 11:24:31,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:24:31,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-10-22 11:24:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:31,084 INFO L225 Difference]: With dead ends: 88 [2019-10-22 11:24:31,084 INFO L226 Difference]: Without dead ends: 88 [2019-10-22 11:24:31,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:24:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-22 11:24:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 63. [2019-10-22 11:24:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-22 11:24:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-10-22 11:24:31,086 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 24 [2019-10-22 11:24:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:31,086 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-10-22 11:24:31,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:24:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-10-22 11:24:31,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:24:31,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:31,087 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] [2019-10-22 11:24:31,087 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:31,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:31,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1660778863, now seen corresponding path program 1 times [2019-10-22 11:24:31,088 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:31,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142822014] [2019-10-22 11:24:31,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:31,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:31,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:31,287 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:24:31,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142822014] [2019-10-22 11:24:31,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:31,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-22 11:24:31,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515562427] [2019-10-22 11:24:31,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:24:31,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:31,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:24:31,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:24:31,289 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 12 states. [2019-10-22 11:24:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:31,510 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-10-22 11:24:31,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:24:31,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-10-22 11:24:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:31,511 INFO L225 Difference]: With dead ends: 66 [2019-10-22 11:24:31,511 INFO L226 Difference]: Without dead ends: 66 [2019-10-22 11:24:31,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:24:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-22 11:24:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-22 11:24:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 11:24:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-10-22 11:24:31,512 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 24 [2019-10-22 11:24:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:31,512 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-10-22 11:24:31,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:24:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-10-22 11:24:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:24:31,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:31,513 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] [2019-10-22 11:24:31,513 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:31,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:31,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1968854422, now seen corresponding path program 1 times [2019-10-22 11:24:31,513 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:31,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135902967] [2019-10-22 11:24:31,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:31,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:31,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:31,561 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:24:31,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135902967] [2019-10-22 11:24:31,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:31,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:31,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285743205] [2019-10-22 11:24:31,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:31,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:31,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:31,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:31,562 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 6 states. [2019-10-22 11:24:31,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:31,600 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-10-22 11:24:31,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:31,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-22 11:24:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:31,601 INFO L225 Difference]: With dead ends: 72 [2019-10-22 11:24:31,601 INFO L226 Difference]: Without dead ends: 72 [2019-10-22 11:24:31,602 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:31,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-22 11:24:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-10-22 11:24:31,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 11:24:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-10-22 11:24:31,603 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 24 [2019-10-22 11:24:31,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:31,603 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-10-22 11:24:31,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-10-22 11:24:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:24:31,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:31,604 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:24:31,604 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:31,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:31,605 INFO L82 PathProgramCache]: Analyzing trace with hash -55462674, now seen corresponding path program 1 times [2019-10-22 11:24:31,605 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:31,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426402151] [2019-10-22 11:24:31,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:31,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:31,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:31,696 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:24:31,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426402151] [2019-10-22 11:24:31,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:31,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:24:31,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180430806] [2019-10-22 11:24:31,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:24:31,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:31,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:24:31,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:31,697 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 10 states. [2019-10-22 11:24:31,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:31,957 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-10-22 11:24:31,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:24:31,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-10-22 11:24:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:31,958 INFO L225 Difference]: With dead ends: 77 [2019-10-22 11:24:31,958 INFO L226 Difference]: Without dead ends: 77 [2019-10-22 11:24:31,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:24:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-22 11:24:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2019-10-22 11:24:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 11:24:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-10-22 11:24:31,960 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 25 [2019-10-22 11:24:31,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:31,960 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-10-22 11:24:31,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:24:31,960 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-10-22 11:24:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:24:31,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:31,960 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:24:31,961 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:31,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:31,961 INFO L82 PathProgramCache]: Analyzing trace with hash -55462673, now seen corresponding path program 1 times [2019-10-22 11:24:31,961 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:31,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790580198] [2019-10-22 11:24:31,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:31,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:31,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:31,995 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:24:31,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790580198] [2019-10-22 11:24:31,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:31,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:31,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718680268] [2019-10-22 11:24:31,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:31,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:31,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:31,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:31,997 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2019-10-22 11:24:32,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:32,050 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-10-22 11:24:32,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:32,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-22 11:24:32,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:32,051 INFO L225 Difference]: With dead ends: 72 [2019-10-22 11:24:32,051 INFO L226 Difference]: Without dead ends: 72 [2019-10-22 11:24:32,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-22 11:24:32,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-10-22 11:24:32,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 11:24:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-10-22 11:24:32,052 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 25 [2019-10-22 11:24:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:32,053 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-10-22 11:24:32,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-10-22 11:24:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:24:32,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:32,053 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:24:32,053 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:32,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:32,054 INFO L82 PathProgramCache]: Analyzing trace with hash -904923004, now seen corresponding path program 1 times [2019-10-22 11:24:32,054 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:32,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371008710] [2019-10-22 11:24:32,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:32,055 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:32,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:32,298 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:24:32,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371008710] [2019-10-22 11:24:32,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:32,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:24:32,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997649298] [2019-10-22 11:24:32,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 11:24:32,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:32,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 11:24:32,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:24:32,300 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 11 states. [2019-10-22 11:24:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:32,657 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-10-22 11:24:32,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:24:32,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-10-22 11:24:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:32,658 INFO L225 Difference]: With dead ends: 71 [2019-10-22 11:24:32,658 INFO L226 Difference]: Without dead ends: 55 [2019-10-22 11:24:32,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:24:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-22 11:24:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-22 11:24:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 11:24:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-10-22 11:24:32,659 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 25 [2019-10-22 11:24:32,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:32,659 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-10-22 11:24:32,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 11:24:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-10-22 11:24:32,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:24:32,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:32,660 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] [2019-10-22 11:24:32,660 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:32,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:32,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1719342829, now seen corresponding path program 1 times [2019-10-22 11:24:32,660 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:32,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30375280] [2019-10-22 11:24:32,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:32,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:32,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:32,751 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:24:32,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30375280] [2019-10-22 11:24:32,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:32,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:24:32,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478046277] [2019-10-22 11:24:32,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 11:24:32,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:32,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 11:24:32,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:24:32,752 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 11 states. [2019-10-22 11:24:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:32,953 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-10-22 11:24:32,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:24:32,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-10-22 11:24:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:32,953 INFO L225 Difference]: With dead ends: 57 [2019-10-22 11:24:32,953 INFO L226 Difference]: Without dead ends: 57 [2019-10-22 11:24:32,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:24:32,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-22 11:24:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-10-22 11:24:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-22 11:24:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-10-22 11:24:32,955 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 26 [2019-10-22 11:24:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:32,955 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-10-22 11:24:32,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 11:24:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-10-22 11:24:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:24:32,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:32,956 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] [2019-10-22 11:24:32,956 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:32,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1316511806, now seen corresponding path program 1 times [2019-10-22 11:24:32,956 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:32,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796610200] [2019-10-22 11:24:32,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:32,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:32,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:33,234 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:24:33,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796610200] [2019-10-22 11:24:33,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:33,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-22 11:24:33,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983548912] [2019-10-22 11:24:33,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:24:33,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:33,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:24:33,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:24:33,236 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 15 states. [2019-10-22 11:24:33,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:33,629 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-10-22 11:24:33,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 11:24:33,629 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-10-22 11:24:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:33,630 INFO L225 Difference]: With dead ends: 53 [2019-10-22 11:24:33,630 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 11:24:33,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2019-10-22 11:24:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 11:24:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-22 11:24:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 11:24:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-10-22 11:24:33,631 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 27 [2019-10-22 11:24:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:33,632 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-10-22 11:24:33,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:24:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-10-22 11:24:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:24:33,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:33,632 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] [2019-10-22 11:24:33,632 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:33,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1760020018, now seen corresponding path program 1 times [2019-10-22 11:24:33,633 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:33,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93274908] [2019-10-22 11:24:33,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:33,735 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:24:33,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93274908] [2019-10-22 11:24:33,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:33,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:24:33,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542780520] [2019-10-22 11:24:33,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 11:24:33,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:33,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 11:24:33,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:24:33,737 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 11 states. [2019-10-22 11:24:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:33,988 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-10-22 11:24:33,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:24:33,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-10-22 11:24:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:33,989 INFO L225 Difference]: With dead ends: 55 [2019-10-22 11:24:33,989 INFO L226 Difference]: Without dead ends: 55 [2019-10-22 11:24:33,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:24:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-22 11:24:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-10-22 11:24:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-22 11:24:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-10-22 11:24:33,992 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 27 [2019-10-22 11:24:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:33,992 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-10-22 11:24:33,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 11:24:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-10-22 11:24:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:24:33,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:33,993 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:24:33,993 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:33,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:33,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1273954421, now seen corresponding path program 1 times [2019-10-22 11:24:33,993 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:33,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967524386] [2019-10-22 11:24:33,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:34,335 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:24:34,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967524386] [2019-10-22 11:24:34,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:34,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-22 11:24:34,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737867771] [2019-10-22 11:24:34,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:24:34,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:34,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:24:34,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:24:34,336 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 15 states. [2019-10-22 11:24:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:35,065 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-10-22 11:24:35,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 11:24:35,065 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-10-22 11:24:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:35,065 INFO L225 Difference]: With dead ends: 55 [2019-10-22 11:24:35,065 INFO L226 Difference]: Without dead ends: 55 [2019-10-22 11:24:35,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2019-10-22 11:24:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-22 11:24:35,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-22 11:24:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 11:24:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-10-22 11:24:35,067 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 28 [2019-10-22 11:24:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:35,067 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-10-22 11:24:35,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:24:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-10-22 11:24:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:24:35,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:35,068 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] [2019-10-22 11:24:35,068 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:35,068 INFO L82 PathProgramCache]: Analyzing trace with hash 204523609, now seen corresponding path program 1 times [2019-10-22 11:24:35,068 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:35,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058118519] [2019-10-22 11:24:35,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:35,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:35,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:35,906 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:24:35,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058118519] [2019-10-22 11:24:35,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:35,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-22 11:24:35,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626260815] [2019-10-22 11:24:35,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-22 11:24:35,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:35,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-22 11:24:35,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:24:35,907 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 17 states. [2019-10-22 11:24:36,371 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-10-22 11:24:36,615 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-10-22 11:24:36,800 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-10-22 11:24:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:37,078 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-10-22 11:24:37,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 11:24:37,079 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-10-22 11:24:37,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:37,079 INFO L225 Difference]: With dead ends: 57 [2019-10-22 11:24:37,079 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 11:24:37,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2019-10-22 11:24:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 11:24:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-22 11:24:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 11:24:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-10-22 11:24:37,080 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 30 [2019-10-22 11:24:37,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:37,081 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-10-22 11:24:37,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-22 11:24:37,081 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-10-22 11:24:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:24:37,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:37,081 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:24:37,082 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:37,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:37,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1629170589, now seen corresponding path program 1 times [2019-10-22 11:24:37,082 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:37,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385160964] [2019-10-22 11:24:37,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:37,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:37,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:37,120 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:24:37,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385160964] [2019-10-22 11:24:37,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:37,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:37,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345537981] [2019-10-22 11:24:37,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:37,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:37,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:37,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:37,121 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 5 states. [2019-10-22 11:24:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:37,140 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2019-10-22 11:24:37,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:37,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:24:37,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:37,141 INFO L225 Difference]: With dead ends: 33 [2019-10-22 11:24:37,141 INFO L226 Difference]: Without dead ends: 33 [2019-10-22 11:24:37,142 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-22 11:24:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-22 11:24:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 11:24:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2019-10-22 11:24:37,143 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 31 [2019-10-22 11:24:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:37,143 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2019-10-22 11:24:37,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2019-10-22 11:24:37,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:24:37,144 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:37,144 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, 1] [2019-10-22 11:24:37,145 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:37,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:37,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1035341227, now seen corresponding path program 1 times [2019-10-22 11:24:37,145 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:37,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780242799] [2019-10-22 11:24:37,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:37,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:37,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:37,908 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:24:37,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780242799] [2019-10-22 11:24:37,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:37,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-22 11:24:37,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266047318] [2019-10-22 11:24:37,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-22 11:24:37,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:37,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-22 11:24:37,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:24:37,910 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand 17 states. [2019-10-22 11:24:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:38,882 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2019-10-22 11:24:38,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 11:24:38,882 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-10-22 11:24:38,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:38,883 INFO L225 Difference]: With dead ends: 32 [2019-10-22 11:24:38,883 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:24:38,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2019-10-22 11:24:38,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:24:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:24:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:24:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:24:38,883 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-10-22 11:24:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:38,883 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:24:38,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-22 11:24:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:24:38,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:24:38,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:38 BoogieIcfgContainer [2019-10-22 11:24:38,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:38,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:38,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:38,888 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:38,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:24" (3/4) ... [2019-10-22 11:24:38,893 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:24:38,905 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-10-22 11:24:38,905 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:24:38,905 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 11:24:38,949 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3dcd2ce4-af2e-423a-94f2-bb98a66d17bd/bin/utaipan/witness.graphml [2019-10-22 11:24:38,950 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:38,951 INFO L168 Benchmark]: Toolchain (without parser) took 15267.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.9 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,951 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:38,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,951 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:38,952 INFO L168 Benchmark]: Boogie Preprocessor took 36.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:38,952 INFO L168 Benchmark]: RCFGBuilder took 416.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,952 INFO L168 Benchmark]: TraceAbstraction took 14079.35 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 262.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -132.8 MB). Peak memory consumption was 129.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,952 INFO L168 Benchmark]: Witness Printer took 61.45 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,953 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 619.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 416.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14079.35 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 262.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -132.8 MB). Peak memory consumption was 129.3 MB. Max. memory is 11.5 GB. * Witness Printer took 61.45 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 769]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 763]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 795]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 764]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 763]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 764]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 769]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 790]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 790]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 776]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 805]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 777]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 769]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 776]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 769]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 777]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 795]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 769]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 795]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 769]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 795]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 769]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 790]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 790]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 790]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 795]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 29 error locations. Result: SAFE, OverallTime: 14.0s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1851 SDtfs, 4717 SDslu, 4990 SDs, 0 SdLazy, 4272 SolverSat, 350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 499 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 782 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 780 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 742 ConstructedInterpolants, 0 QuantifiedInterpolants, 195704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...