./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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 e2d5d691ed29cb8b2a6f5a402a7f2a124682fa21 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 02:20:46,148 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:20:46,149 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:20:46,155 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:20:46,155 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:20:46,156 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:20:46,157 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:20:46,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:20:46,159 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:20:46,159 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:20:46,160 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:20:46,160 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:20:46,161 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:20:46,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:20:46,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:20:46,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:20:46,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:20:46,164 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:20:46,165 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:20:46,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:20:46,166 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:20:46,167 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:20:46,168 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:20:46,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:20:46,168 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:20:46,169 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:20:46,169 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:20:46,170 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:20:46,170 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:20:46,171 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:20:46,171 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:20:46,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:20:46,172 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:20:46,172 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:20:46,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:20:46,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:20:46,173 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 02:20:46,180 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:20:46,181 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:20:46,181 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:20:46,181 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:20:46,181 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:20:46,182 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:20:46,182 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:20:46,182 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 02:20:46,182 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:20:46,182 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:20:46,182 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 02:20:46,182 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 02:20:46,182 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:20:46,183 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 02:20:46,183 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 02:20:46,183 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:20:46,183 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:20:46,183 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 02:20:46,183 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:20:46,183 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:20:46,183 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:20:46,184 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 02:20:46,184 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 02:20:46,184 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 02:20:46,184 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:20:46,184 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:20:46,184 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:20:46,184 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:20:46,184 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:20:46,184 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:20:46,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:20:46,184 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:20:46,185 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:20:46,185 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 02:20:46,185 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:20:46,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 02:20:46,185 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> e2d5d691ed29cb8b2a6f5a402a7f2a124682fa21 [2018-12-03 02:20:46,202 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:20:46,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:20:46,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:20:46,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:20:46,212 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:20:46,212 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i [2018-12-03 02:20:46,247 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan/data/c1be02f9e/a2e5c97e3260440baf05fe1daf5ab5bc/FLAG613b66cd5 [2018-12-03 02:20:46,720 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:20:46,721 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/sv-benchmarks/c/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i [2018-12-03 02:20:46,728 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan/data/c1be02f9e/a2e5c97e3260440baf05fe1daf5ab5bc/FLAG613b66cd5 [2018-12-03 02:20:47,233 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan/data/c1be02f9e/a2e5c97e3260440baf05fe1daf5ab5bc [2018-12-03 02:20:47,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:20:47,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:20:47,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:20:47,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:20:47,239 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:20:47,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:20:47" (1/1) ... [2018-12-03 02:20:47,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417514c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:20:47, skipping insertion in model container [2018-12-03 02:20:47,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:20:47" (1/1) ... [2018-12-03 02:20:47,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:20:47,273 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:20:47,502 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:20:47,510 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:20:47,542 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:20:47,575 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:20:47,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:20:47 WrapperNode [2018-12-03 02:20:47,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:20:47,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:20:47,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:20:47,576 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:20:47,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:20:47" (1/1) ... [2018-12-03 02:20:47,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:20:47" (1/1) ... [2018-12-03 02:20:47,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:20:47,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:20:47,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:20:47,598 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:20:47,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:20:47" (1/1) ... [2018-12-03 02:20:47,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:20:47" (1/1) ... [2018-12-03 02:20:47,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:20:47" (1/1) ... [2018-12-03 02:20:47,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:20:47" (1/1) ... [2018-12-03 02:20:47,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:20:47" (1/1) ... [2018-12-03 02:20:47,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:20:47" (1/1) ... [2018-12-03 02:20:47,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:20:47" (1/1) ... [2018-12-03 02:20:47,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:20:47,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:20:47,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:20:47,615 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:20:47,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:20:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:20:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 02:20:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-03 02:20:47,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-03 02:20:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 02:20:47,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 02:20:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 02:20:47,647 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 02:20:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 02:20:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2018-12-03 02:20:47,647 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2018-12-03 02:20:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 02:20:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2018-12-03 02:20:47,648 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2018-12-03 02:20:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 02:20:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 02:20:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-03 02:20:47,648 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-03 02:20:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:20:47,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:20:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-12-03 02:20:47,648 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-12-03 02:20:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-12-03 02:20:47,648 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-12-03 02:20:47,811 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:20:47,811 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 02:20:47,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:20:47 BoogieIcfgContainer [2018-12-03 02:20:47,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:20:47,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:20:47,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:20:47,814 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:20:47,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:20:47" (1/3) ... [2018-12-03 02:20:47,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b166287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:20:47, skipping insertion in model container [2018-12-03 02:20:47,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:20:47" (2/3) ... [2018-12-03 02:20:47,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b166287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:20:47, skipping insertion in model container [2018-12-03 02:20:47,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:20:47" (3/3) ... [2018-12-03 02:20:47,816 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test6_true-valid-memsafety_true-termination.i [2018-12-03 02:20:47,822 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:20:47,827 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-12-03 02:20:47,836 INFO L257 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2018-12-03 02:20:47,851 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:20:47,851 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 02:20:47,851 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:20:47,852 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:20:47,852 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:20:47,852 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:20:47,852 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:20:47,852 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:20:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-12-03 02:20:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 02:20:47,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:47,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:20:47,869 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:47,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:47,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1363142069, now seen corresponding path program 1 times [2018-12-03 02:20:47,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:47,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:47,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:47,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:47,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:48,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:48,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:20:48,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:48,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:20:48,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:20:48,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:20:48,012 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 5 states. [2018-12-03 02:20:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:48,047 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-12-03 02:20:48,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:20:48,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-03 02:20:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:48,056 INFO L225 Difference]: With dead ends: 79 [2018-12-03 02:20:48,056 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 02:20:48,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:20:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 02:20:48,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2018-12-03 02:20:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 02:20:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-12-03 02:20:48,084 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 20 [2018-12-03 02:20:48,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:48,084 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-12-03 02:20:48,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:20:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-12-03 02:20:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 02:20:48,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:48,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:20:48,085 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:48,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:48,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1166628564, now seen corresponding path program 1 times [2018-12-03 02:20:48,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:48,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:48,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:48,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:48,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:20:48,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:48,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:20:48,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:20:48,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:20:48,127 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 4 states. [2018-12-03 02:20:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:48,210 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-12-03 02:20:48,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:20:48,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-03 02:20:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:48,212 INFO L225 Difference]: With dead ends: 100 [2018-12-03 02:20:48,212 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 02:20:48,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:20:48,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 02:20:48,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2018-12-03 02:20:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 02:20:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2018-12-03 02:20:48,218 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 20 [2018-12-03 02:20:48,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:48,218 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2018-12-03 02:20:48,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:20:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2018-12-03 02:20:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 02:20:48,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:48,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:20:48,219 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:48,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:48,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1166628565, now seen corresponding path program 1 times [2018-12-03 02:20:48,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:48,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:48,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:48,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:48,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:20:48,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:48,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:20:48,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:20:48,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:20:48,262 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand 4 states. [2018-12-03 02:20:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:48,340 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-12-03 02:20:48,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:20:48,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-03 02:20:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:48,341 INFO L225 Difference]: With dead ends: 112 [2018-12-03 02:20:48,341 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 02:20:48,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:20:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 02:20:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2018-12-03 02:20:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 02:20:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-12-03 02:20:48,347 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 20 [2018-12-03 02:20:48,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:48,347 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-12-03 02:20:48,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:20:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-12-03 02:20:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 02:20:48,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:48,348 INFO L402 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] [2018-12-03 02:20:48,348 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:48,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:48,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1670185029, now seen corresponding path program 1 times [2018-12-03 02:20:48,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:48,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:48,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:20:48,375 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:48,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:20:48,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:20:48,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:20:48,375 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 5 states. [2018-12-03 02:20:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:48,386 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2018-12-03 02:20:48,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:20:48,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-03 02:20:48,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:48,387 INFO L225 Difference]: With dead ends: 97 [2018-12-03 02:20:48,387 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 02:20:48,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:20:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 02:20:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 02:20:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 02:20:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2018-12-03 02:20:48,392 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 22 [2018-12-03 02:20:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:48,392 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2018-12-03 02:20:48,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:20:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2018-12-03 02:20:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 02:20:48,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:48,393 INFO L402 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] [2018-12-03 02:20:48,393 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:48,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:48,393 INFO L82 PathProgramCache]: Analyzing trace with hash 143536354, now seen corresponding path program 1 times [2018-12-03 02:20:48,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:48,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:48,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:48,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:20:48,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:48,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:20:48,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:20:48,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:20:48,425 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand 6 states. [2018-12-03 02:20:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:48,540 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2018-12-03 02:20:48,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:20:48,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-03 02:20:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:48,541 INFO L225 Difference]: With dead ends: 114 [2018-12-03 02:20:48,541 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 02:20:48,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:20:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 02:20:48,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2018-12-03 02:20:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 02:20:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2018-12-03 02:20:48,547 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 22 [2018-12-03 02:20:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:48,547 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2018-12-03 02:20:48,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:20:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2018-12-03 02:20:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 02:20:48,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:48,547 INFO L402 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] [2018-12-03 02:20:48,548 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:48,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:48,548 INFO L82 PathProgramCache]: Analyzing trace with hash 143536355, now seen corresponding path program 1 times [2018-12-03 02:20:48,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:48,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:48,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:48,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:48,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:20:48,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:48,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:20:48,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:20:48,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:20:48,575 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand 6 states. [2018-12-03 02:20:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:48,592 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2018-12-03 02:20:48,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:20:48,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-03 02:20:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:48,594 INFO L225 Difference]: With dead ends: 107 [2018-12-03 02:20:48,594 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 02:20:48,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:20:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 02:20:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 02:20:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 02:20:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-12-03 02:20:48,601 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 22 [2018-12-03 02:20:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:48,602 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-12-03 02:20:48,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:20:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-12-03 02:20:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 02:20:48,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:48,603 INFO L402 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] [2018-12-03 02:20:48,603 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:48,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:48,603 INFO L82 PathProgramCache]: Analyzing trace with hash -236128249, now seen corresponding path program 1 times [2018-12-03 02:20:48,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:48,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:48,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:48,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:48,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:20:48,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:48,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:20:48,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:20:48,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:20:48,640 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 5 states. [2018-12-03 02:20:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:48,692 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2018-12-03 02:20:48,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:20:48,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-03 02:20:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:48,693 INFO L225 Difference]: With dead ends: 105 [2018-12-03 02:20:48,693 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 02:20:48,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:20:48,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 02:20:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-12-03 02:20:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 02:20:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2018-12-03 02:20:48,698 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 23 [2018-12-03 02:20:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:48,698 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-12-03 02:20:48,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:20:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-12-03 02:20:48,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 02:20:48,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:48,699 INFO L402 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] [2018-12-03 02:20:48,699 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:48,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:48,699 INFO L82 PathProgramCache]: Analyzing trace with hash -529531256, now seen corresponding path program 1 times [2018-12-03 02:20:48,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:48,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:48,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:48,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:48,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:20:48,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:48,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:20:48,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:20:48,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:20:48,727 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand 5 states. [2018-12-03 02:20:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:48,736 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-12-03 02:20:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:20:48,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-03 02:20:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:48,737 INFO L225 Difference]: With dead ends: 67 [2018-12-03 02:20:48,737 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 02:20:48,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:20:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 02:20:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 02:20:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 02:20:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-12-03 02:20:48,740 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 23 [2018-12-03 02:20:48,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:48,740 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-12-03 02:20:48,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:20:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-12-03 02:20:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 02:20:48,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:48,741 INFO L402 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] [2018-12-03 02:20:48,741 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:48,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:48,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1166268303, now seen corresponding path program 1 times [2018-12-03 02:20:48,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:48,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:48,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:48,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:48,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:20:48,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:48,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:20:48,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:20:48,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:20:48,809 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 7 states. [2018-12-03 02:20:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:48,952 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-12-03 02:20:48,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:20:48,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-03 02:20:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:48,953 INFO L225 Difference]: With dead ends: 72 [2018-12-03 02:20:48,954 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 02:20:48,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:20:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 02:20:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-12-03 02:20:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 02:20:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-12-03 02:20:48,957 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 28 [2018-12-03 02:20:48,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:48,957 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-12-03 02:20:48,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:20:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-12-03 02:20:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 02:20:48,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:48,958 INFO L402 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] [2018-12-03 02:20:48,958 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:48,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:48,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1166268302, now seen corresponding path program 1 times [2018-12-03 02:20:48,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:48,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:48,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:48,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:49,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:49,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:20:49,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:49,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:20:49,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:20:49,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:20:49,057 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 8 states. [2018-12-03 02:20:49,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:49,199 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-12-03 02:20:49,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 02:20:49,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-03 02:20:49,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:49,200 INFO L225 Difference]: With dead ends: 60 [2018-12-03 02:20:49,200 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 02:20:49,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:20:49,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 02:20:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 02:20:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 02:20:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-12-03 02:20:49,203 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 28 [2018-12-03 02:20:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:49,203 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-12-03 02:20:49,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:20:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-12-03 02:20:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 02:20:49,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:49,204 INFO L402 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] [2018-12-03 02:20:49,204 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:49,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:49,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1526427473, now seen corresponding path program 1 times [2018-12-03 02:20:49,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:49,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:49,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:49,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:49,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:49,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:49,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:20:49,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:49,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:20:49,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:20:49,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:20:49,294 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 7 states. [2018-12-03 02:20:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:49,434 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-12-03 02:20:49,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:20:49,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-03 02:20:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:49,436 INFO L225 Difference]: With dead ends: 64 [2018-12-03 02:20:49,436 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 02:20:49,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:20:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 02:20:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 02:20:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 02:20:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-12-03 02:20:49,438 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 28 [2018-12-03 02:20:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:49,438 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-12-03 02:20:49,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:20:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-12-03 02:20:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 02:20:49,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:49,439 INFO L402 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] [2018-12-03 02:20:49,439 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:49,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:49,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1981964285, now seen corresponding path program 1 times [2018-12-03 02:20:49,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:49,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:49,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:49,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:49,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:49,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:49,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:20:49,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:49,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:20:49,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:20:49,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:20:49,483 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-12-03 02:20:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:49,496 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-12-03 02:20:49,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:20:49,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-03 02:20:49,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:49,497 INFO L225 Difference]: With dead ends: 58 [2018-12-03 02:20:49,497 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 02:20:49,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:20:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 02:20:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-12-03 02:20:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 02:20:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 02:20:49,499 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 30 [2018-12-03 02:20:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:49,499 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 02:20:49,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:20:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 02:20:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 02:20:49,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:49,500 INFO L402 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, 1, 1, 1, 1] [2018-12-03 02:20:49,500 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:49,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:49,500 INFO L82 PathProgramCache]: Analyzing trace with hash -853745354, now seen corresponding path program 1 times [2018-12-03 02:20:49,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:49,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:49,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:49,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:49,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:49,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:49,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:20:49,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:49,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:20:49,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:20:49,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:20:49,558 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 8 states. [2018-12-03 02:20:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:49,650 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 02:20:49,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 02:20:49,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-03 02:20:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:49,651 INFO L225 Difference]: With dead ends: 49 [2018-12-03 02:20:49,651 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 02:20:49,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:20:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 02:20:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 02:20:49,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 02:20:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 02:20:49,654 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 36 [2018-12-03 02:20:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:49,654 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 02:20:49,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:20:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 02:20:49,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 02:20:49,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:49,655 INFO L402 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, 1, 1, 1, 1, 1] [2018-12-03 02:20:49,655 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:49,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:49,655 INFO L82 PathProgramCache]: Analyzing trace with hash -696302238, now seen corresponding path program 1 times [2018-12-03 02:20:49,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:49,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:49,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:49,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:49,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:49,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:49,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 02:20:49,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:49,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:20:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:20:49,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:20:49,744 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 11 states. [2018-12-03 02:20:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:49,857 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 02:20:49,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:20:49,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-12-03 02:20:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:49,857 INFO L225 Difference]: With dead ends: 48 [2018-12-03 02:20:49,858 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 02:20:49,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-12-03 02:20:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 02:20:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 02:20:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 02:20:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 02:20:49,859 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 37 [2018-12-03 02:20:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:49,859 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 02:20:49,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:20:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 02:20:49,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 02:20:49,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:49,860 INFO L402 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, 1, 1, 1, 1, 1] [2018-12-03 02:20:49,860 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:49,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:49,860 INFO L82 PathProgramCache]: Analyzing trace with hash -694761124, now seen corresponding path program 1 times [2018-12-03 02:20:49,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:49,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:49,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:49,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:49,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:49,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:49,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:20:49,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:49,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:20:49,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:20:49,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:20:49,881 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 5 states. [2018-12-03 02:20:49,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:49,884 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2018-12-03 02:20:49,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:20:49,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-12-03 02:20:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:49,885 INFO L225 Difference]: With dead ends: 47 [2018-12-03 02:20:49,885 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 02:20:49,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:20:49,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 02:20:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 02:20:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 02:20:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 46 transitions. [2018-12-03 02:20:49,886 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 46 transitions. Word has length 37 [2018-12-03 02:20:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:49,886 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 46 transitions. [2018-12-03 02:20:49,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:20:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 46 transitions. [2018-12-03 02:20:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 02:20:49,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:49,887 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-03 02:20:49,887 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:49,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:49,887 INFO L82 PathProgramCache]: Analyzing trace with hash -110532843, now seen corresponding path program 1 times [2018-12-03 02:20:49,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:49,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:49,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:49,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:49,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:49,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:49,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 02:20:49,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:49,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:20:49,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:20:49,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:20:49,983 INFO L87 Difference]: Start difference. First operand 47 states and 46 transitions. Second operand 11 states. [2018-12-03 02:20:50,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:50,063 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-12-03 02:20:50,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:20:50,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-12-03 02:20:50,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:50,064 INFO L225 Difference]: With dead ends: 46 [2018-12-03 02:20:50,064 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 02:20:50,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-12-03 02:20:50,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 02:20:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 02:20:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 02:20:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2018-12-03 02:20:50,065 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 38 [2018-12-03 02:20:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:50,065 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2018-12-03 02:20:50,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:20:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2018-12-03 02:20:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 02:20:50,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:50,066 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:20:50,066 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:50,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:50,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1356047482, now seen corresponding path program 1 times [2018-12-03 02:20:50,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:50,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:50,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:50,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:50,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:50,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:50,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 02:20:50,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:50,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 02:20:50,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 02:20:50,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:20:50,164 INFO L87 Difference]: Start difference. First operand 46 states and 45 transitions. Second operand 13 states. [2018-12-03 02:20:50,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:50,396 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2018-12-03 02:20:50,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 02:20:50,397 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-12-03 02:20:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:50,397 INFO L225 Difference]: With dead ends: 45 [2018-12-03 02:20:50,397 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 02:20:50,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2018-12-03 02:20:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 02:20:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 02:20:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 02:20:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 44 transitions. [2018-12-03 02:20:50,399 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 44 transitions. Word has length 41 [2018-12-03 02:20:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:50,399 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 44 transitions. [2018-12-03 02:20:50,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 02:20:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 44 transitions. [2018-12-03 02:20:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 02:20:50,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:20:50,400 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:20:50,400 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-03 02:20:50,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:20:50,400 INFO L82 PathProgramCache]: Analyzing trace with hash -451840023, now seen corresponding path program 1 times [2018-12-03 02:20:50,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:20:50,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:50,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:20:50,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:20:50,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:20:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:20:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:20:50,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:20:50,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:20:50,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:20:50,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:20:50,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:20:50,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:20:50,504 INFO L87 Difference]: Start difference. First operand 45 states and 44 transitions. Second operand 12 states. [2018-12-03 02:20:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:20:50,655 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2018-12-03 02:20:50,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:20:50,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-12-03 02:20:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:20:50,656 INFO L225 Difference]: With dead ends: 44 [2018-12-03 02:20:50,656 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 02:20:50,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-12-03 02:20:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 02:20:50,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 02:20:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 02:20:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 02:20:50,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-12-03 02:20:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:20:50,657 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 02:20:50,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:20:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 02:20:50,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 02:20:50,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 02:20:50 BoogieIcfgContainer [2018-12-03 02:20:50,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 02:20:50,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 02:20:50,662 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 02:20:50,662 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 02:20:50,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:20:47" (3/4) ... [2018-12-03 02:20:50,665 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 02:20:50,669 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f6 [2018-12-03 02:20:50,669 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2018-12-03 02:20:50,669 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 02:20:50,669 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 02:20:50,669 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure disconnect_6 [2018-12-03 02:20:50,670 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2018-12-03 02:20:50,670 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g6 [2018-12-03 02:20:50,670 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure probe1_6 [2018-12-03 02:20:50,673 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-03 02:20:50,673 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-03 02:20:50,673 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 02:20:50,701 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0b6bbdc8-eaaf-4d29-b257-59cab37ea72c/bin-2019/utaipan/witness.graphml [2018-12-03 02:20:50,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 02:20:50,702 INFO L168 Benchmark]: Toolchain (without parser) took 3466.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 951.3 MB in the beginning and 810.5 MB in the end (delta: 140.8 MB). Peak memory consumption was 336.9 MB. Max. memory is 11.5 GB. [2018-12-03 02:20:50,703 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:20:50,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -128.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-03 02:20:50,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.60 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. [2018-12-03 02:20:50,704 INFO L168 Benchmark]: Boogie Preprocessor took 16.83 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. [2018-12-03 02:20:50,704 INFO L168 Benchmark]: RCFGBuilder took 196.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-03 02:20:50,704 INFO L168 Benchmark]: TraceAbstraction took 2849.18 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 810.5 MB in the end (delta: 244.1 MB). Peak memory consumption was 328.0 MB. Max. memory is 11.5 GB. [2018-12-03 02:20:50,704 INFO L168 Benchmark]: Witness Printer took 39.84 ms. Allocated memory is still 1.2 GB. Free memory is still 810.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:20:50,706 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -128.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.60 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 16.83 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 196.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2849.18 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 810.5 MB in the end (delta: 244.1 MB). Peak memory consumption was 328.0 MB. Max. memory is 11.5 GB. * Witness Printer took 39.84 ms. Allocated memory is still 1.2 GB. Free memory is still 810.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1476]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1462]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1462]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1462]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1462]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1473]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1473]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1453]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1457]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1453]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1457]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 60 locations, 11 error locations. SAFE Result, 2.8s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 885 SDtfs, 743 SDslu, 2318 SDs, 0 SdLazy, 1555 SolverSat, 213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 71 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 85200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...