./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7_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_a3a1cd34-3d05-4145-881e-4a97bf270978/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a3a1cd34-3d05-4145-881e-4a97bf270978/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a3a1cd34-3d05-4145-881e-4a97bf270978/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a3a1cd34-3d05-4145-881e-4a97bf270978/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a3a1cd34-3d05-4145-881e-4a97bf270978/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a3a1cd34-3d05-4145-881e-4a97bf270978/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 b9665c64f05d33d8cbaad336d091302b2843ac77 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 20:53:24,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:53:24,811 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:53:24,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:53:24,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:53:24,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:53:24,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:53:24,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:53:24,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:53:24,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:53:24,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:53:24,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:53:24,826 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:53:24,827 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:53:24,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:53:24,828 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:53:24,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:53:24,830 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:53:24,831 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:53:24,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:53:24,833 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:53:24,834 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:53:24,836 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:53:24,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:53:24,836 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:53:24,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:53:24,837 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:53:24,838 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:53:24,838 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:53:24,839 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:53:24,839 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:53:24,840 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:53:24,840 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:53:24,840 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:53:24,841 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:53:24,841 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:53:24,841 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a3a1cd34-3d05-4145-881e-4a97bf270978/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 20:53:24,852 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:53:24,852 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:53:24,853 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 20:53:24,853 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 20:53:24,853 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 20:53:24,853 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 20:53:24,853 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 20:53:24,854 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 20:53:24,854 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 20:53:24,854 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 20:53:24,854 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 20:53:24,854 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 20:53:24,854 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 20:53:24,854 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 20:53:24,855 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 20:53:24,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:53:24,855 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:53:24,855 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 20:53:24,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:53:24,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:53:24,856 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:53:24,856 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 20:53:24,856 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 20:53:24,856 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 20:53:24,856 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 20:53:24,856 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:53:24,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:53:24,856 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:53:24,857 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 20:53:24,857 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 20:53:24,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:53:24,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:53:24,857 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 20:53:24,857 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 20:53:24,857 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 20:53:24,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 20:53:24,857 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_a3a1cd34-3d05-4145-881e-4a97bf270978/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 -> b9665c64f05d33d8cbaad336d091302b2843ac77 [2018-12-02 20:53:24,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:53:24,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:53:24,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:53:24,893 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:53:24,894 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:53:24,894 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a3a1cd34-3d05-4145-881e-4a97bf270978/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i [2018-12-02 20:53:24,938 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3a1cd34-3d05-4145-881e-4a97bf270978/bin-2019/utaipan/data/fffa9f5cf/134ece6feaa7423bb3028e359a518315/FLAGe29f319b7 [2018-12-02 20:53:25,396 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:53:25,396 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a3a1cd34-3d05-4145-881e-4a97bf270978/sv-benchmarks/c/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i [2018-12-02 20:53:25,403 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3a1cd34-3d05-4145-881e-4a97bf270978/bin-2019/utaipan/data/fffa9f5cf/134ece6feaa7423bb3028e359a518315/FLAGe29f319b7 [2018-12-02 20:53:25,411 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a3a1cd34-3d05-4145-881e-4a97bf270978/bin-2019/utaipan/data/fffa9f5cf/134ece6feaa7423bb3028e359a518315 [2018-12-02 20:53:25,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:53:25,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 20:53:25,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:53:25,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:53:25,416 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:53:25,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:53:25" (1/1) ... [2018-12-02 20:53:25,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142c46d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:53:25, skipping insertion in model container [2018-12-02 20:53:25,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:53:25" (1/1) ... [2018-12-02 20:53:25,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:53:25,445 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:53:25,659 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:53:25,667 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:53:25,702 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:53:25,736 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:53:25,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:53:25 WrapperNode [2018-12-02 20:53:25,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:53:25,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 20:53:25,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 20:53:25,737 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 20:53:25,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:53:25" (1/1) ... [2018-12-02 20:53:25,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:53:25" (1/1) ... [2018-12-02 20:53:25,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 20:53:25,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:53:25,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:53:25,759 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:53:25,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:53:25" (1/1) ... [2018-12-02 20:53:25,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:53:25" (1/1) ... [2018-12-02 20:53:25,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:53:25" (1/1) ... [2018-12-02 20:53:25,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:53:25" (1/1) ... [2018-12-02 20:53:25,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:53:25" (1/1) ... [2018-12-02 20:53:25,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:53:25" (1/1) ... [2018-12-02 20:53:25,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:53:25" (1/1) ... [2018-12-02 20:53:25,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:53:25,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:53:25,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:53:25,777 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:53:25,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:53:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3a1cd34-3d05-4145-881e-4a97bf270978/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:53:25,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 20:53:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 20:53:25,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 20:53:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 20:53:25,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 20:53:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 20:53:25,812 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 20:53:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 20:53:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2018-12-02 20:53:25,812 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2018-12-02 20:53:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 20:53:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2018-12-02 20:53:25,812 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2018-12-02 20:53:25,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 20:53:25,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 20:53:25,813 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 20:53:25,813 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 20:53:25,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:53:25,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:53:25,813 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-12-02 20:53:25,813 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-12-02 20:53:25,813 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-12-02 20:53:25,813 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-12-02 20:53:25,964 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:53:25,965 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 20:53:25,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:53:25 BoogieIcfgContainer [2018-12-02 20:53:25,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:53:25,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 20:53:25,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 20:53:25,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 20:53:25,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:53:25" (1/3) ... [2018-12-02 20:53:25,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a089241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:53:25, skipping insertion in model container [2018-12-02 20:53:25,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:53:25" (2/3) ... [2018-12-02 20:53:25,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a089241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:53:25, skipping insertion in model container [2018-12-02 20:53:25,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:53:25" (3/3) ... [2018-12-02 20:53:25,969 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test7_true-valid-memsafety_true-termination.i [2018-12-02 20:53:25,975 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 20:53:25,979 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-02 20:53:25,987 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-02 20:53:26,004 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 20:53:26,004 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 20:53:26,004 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 20:53:26,004 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:53:26,004 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:53:26,004 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 20:53:26,004 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:53:26,004 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 20:53:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-12-02 20:53:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 20:53:26,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:26,020 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-02 20:53:26,021 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:26,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:26,024 INFO L82 PathProgramCache]: Analyzing trace with hash 624371525, now seen corresponding path program 1 times [2018-12-02 20:53:26,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:26,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:26,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:26,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:26,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:53:26,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:26,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:53:26,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:53:26,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:53:26,165 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 5 states. [2018-12-02 20:53:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:26,206 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-12-02 20:53:26,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:53:26,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-02 20:53:26,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:26,215 INFO L225 Difference]: With dead ends: 78 [2018-12-02 20:53:26,215 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 20:53:26,216 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-02 20:53:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 20:53:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2018-12-02 20:53:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 20:53:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-12-02 20:53:26,246 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 23 [2018-12-02 20:53:26,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:26,246 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-12-02 20:53:26,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:53:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-12-02 20:53:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 20:53:26,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:26,247 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-02 20:53:26,247 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:26,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1032621123, now seen corresponding path program 1 times [2018-12-02 20:53:26,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:26,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:26,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:26,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:26,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:53:26,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:26,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:53:26,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:53:26,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:53:26,300 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2018-12-02 20:53:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:26,315 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-12-02 20:53:26,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:53:26,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-02 20:53:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:26,316 INFO L225 Difference]: With dead ends: 59 [2018-12-02 20:53:26,316 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 20:53:26,317 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-02 20:53:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 20:53:26,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-02 20:53:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 20:53:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-12-02 20:53:26,323 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 23 [2018-12-02 20:53:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:26,323 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-12-02 20:53:26,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:53:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-12-02 20:53:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 20:53:26,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:26,324 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-02 20:53:26,324 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:26,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:26,325 INFO L82 PathProgramCache]: Analyzing trace with hash 753454244, now seen corresponding path program 1 times [2018-12-02 20:53:26,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:26,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:26,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:26,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:26,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:53:26,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:26,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:53:26,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:53:26,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:53:26,383 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-12-02 20:53:26,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:26,498 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-12-02 20:53:26,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:53:26,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-02 20:53:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:26,499 INFO L225 Difference]: With dead ends: 85 [2018-12-02 20:53:26,499 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 20:53:26,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:53:26,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 20:53:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2018-12-02 20:53:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 20:53:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2018-12-02 20:53:26,505 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 23 [2018-12-02 20:53:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:26,505 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-12-02 20:53:26,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:53:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2018-12-02 20:53:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 20:53:26,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:26,506 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-02 20:53:26,506 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:26,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:26,506 INFO L82 PathProgramCache]: Analyzing trace with hash 753454245, now seen corresponding path program 1 times [2018-12-02 20:53:26,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:26,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:26,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:26,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:26,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:53:26,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:26,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:53:26,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:53:26,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:53:26,538 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand 6 states. [2018-12-02 20:53:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:26,562 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2018-12-02 20:53:26,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:53:26,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-02 20:53:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:26,563 INFO L225 Difference]: With dead ends: 81 [2018-12-02 20:53:26,563 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 20:53:26,563 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-02 20:53:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 20:53:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-12-02 20:53:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-02 20:53:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-12-02 20:53:26,568 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 23 [2018-12-02 20:53:26,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:26,569 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-12-02 20:53:26,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:53:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-12-02 20:53:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 20:53:26,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:26,569 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] [2018-12-02 20:53:26,569 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:26,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:26,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1946483644, now seen corresponding path program 1 times [2018-12-02 20:53:26,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:26,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:26,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:26,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:26,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:53:26,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:26,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:53:26,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:53:26,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:53:26,606 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 5 states. [2018-12-02 20:53:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:26,657 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-12-02 20:53:26,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:53:26,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-12-02 20:53:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:26,658 INFO L225 Difference]: With dead ends: 84 [2018-12-02 20:53:26,658 INFO L226 Difference]: Without dead ends: 84 [2018-12-02 20:53:26,658 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-02 20:53:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-02 20:53:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-12-02 20:53:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-02 20:53:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2018-12-02 20:53:26,662 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 24 [2018-12-02 20:53:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:26,663 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2018-12-02 20:53:26,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:53:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2018-12-02 20:53:26,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 20:53:26,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:26,663 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] [2018-12-02 20:53:26,664 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:26,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:26,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2055080645, now seen corresponding path program 1 times [2018-12-02 20:53:26,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:26,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:26,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:26,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:26,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:53:26,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:26,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:53:26,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:53:26,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:53:26,694 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand 5 states. [2018-12-02 20:53:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:26,709 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-12-02 20:53:26,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:53:26,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-12-02 20:53:26,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:26,711 INFO L225 Difference]: With dead ends: 62 [2018-12-02 20:53:26,711 INFO L226 Difference]: Without dead ends: 62 [2018-12-02 20:53:26,711 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-02 20:53:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-02 20:53:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-02 20:53:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 20:53:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-12-02 20:53:26,715 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 24 [2018-12-02 20:53:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:26,715 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-12-02 20:53:26,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:53:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-12-02 20:53:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 20:53:26,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:26,716 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] [2018-12-02 20:53:26,716 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:26,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:26,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1883844779, now seen corresponding path program 1 times [2018-12-02 20:53:26,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:26,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:26,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:26,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:26,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:26,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:53:26,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:26,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:53:26,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:53:26,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:53:26,772 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 4 states. [2018-12-02 20:53:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:26,824 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-12-02 20:53:26,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:53:26,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-12-02 20:53:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:26,825 INFO L225 Difference]: With dead ends: 66 [2018-12-02 20:53:26,825 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 20:53:26,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:53:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 20:53:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-02 20:53:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 20:53:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-12-02 20:53:26,828 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 24 [2018-12-02 20:53:26,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:26,828 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-12-02 20:53:26,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:53:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-12-02 20:53:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 20:53:26,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:26,829 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] [2018-12-02 20:53:26,829 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:26,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:26,829 INFO L82 PathProgramCache]: Analyzing trace with hash 488741555, now seen corresponding path program 1 times [2018-12-02 20:53:26,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:26,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:26,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:26,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:26,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:26,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:53:26,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:26,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 20:53:26,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:53:26,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:53:26,899 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 7 states. [2018-12-02 20:53:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:27,019 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-12-02 20:53:27,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 20:53:27,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-12-02 20:53:27,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:27,020 INFO L225 Difference]: With dead ends: 59 [2018-12-02 20:53:27,020 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 20:53:27,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:53:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 20:53:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-12-02 20:53:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 20:53:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-12-02 20:53:27,023 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 29 [2018-12-02 20:53:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:27,024 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-12-02 20:53:27,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 20:53:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-12-02 20:53:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 20:53:27,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:27,024 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] [2018-12-02 20:53:27,025 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:27,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:27,025 INFO L82 PathProgramCache]: Analyzing trace with hash 488741556, now seen corresponding path program 1 times [2018-12-02 20:53:27,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:27,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:27,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:27,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:27,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 20:53:27,112 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:27,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:53:27,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:53:27,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:53:27,113 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 8 states. [2018-12-02 20:53:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:27,219 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-12-02 20:53:27,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 20:53:27,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-12-02 20:53:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:27,220 INFO L225 Difference]: With dead ends: 52 [2018-12-02 20:53:27,220 INFO L226 Difference]: Without dead ends: 52 [2018-12-02 20:53:27,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:53:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-02 20:53:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-02 20:53:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 20:53:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-12-02 20:53:27,223 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 29 [2018-12-02 20:53:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:27,223 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-12-02 20:53:27,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:53:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-12-02 20:53:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 20:53:27,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:27,224 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] [2018-12-02 20:53:27,225 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:27,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash 680130911, now seen corresponding path program 1 times [2018-12-02 20:53:27,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:27,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:27,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:53:27,277 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:27,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:53:27,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:53:27,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:53:27,277 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 6 states. [2018-12-02 20:53:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:27,292 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-12-02 20:53:27,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:53:27,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-02 20:53:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:27,293 INFO L225 Difference]: With dead ends: 59 [2018-12-02 20:53:27,293 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 20:53:27,294 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-02 20:53:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 20:53:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-12-02 20:53:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 20:53:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-02 20:53:27,296 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 31 [2018-12-02 20:53:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:27,296 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-02 20:53:27,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:53:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-02 20:53:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 20:53:27,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:27,297 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] [2018-12-02 20:53:27,297 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:27,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:27,298 INFO L82 PathProgramCache]: Analyzing trace with hash -389178544, now seen corresponding path program 1 times [2018-12-02 20:53:27,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:27,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:27,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:27,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:27,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 20:53:27,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:27,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:53:27,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:53:27,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:53:27,406 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 8 states. [2018-12-02 20:53:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:27,508 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-12-02 20:53:27,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:53:27,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-12-02 20:53:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:27,509 INFO L225 Difference]: With dead ends: 60 [2018-12-02 20:53:27,509 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 20:53:27,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:53:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 20:53:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-02 20:53:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 20:53:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-02 20:53:27,512 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 32 [2018-12-02 20:53:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:27,512 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-02 20:53:27,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:53:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-02 20:53:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 20:53:27,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:27,513 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-02 20:53:27,514 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:27,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:27,514 INFO L82 PathProgramCache]: Analyzing trace with hash -815318825, now seen corresponding path program 1 times [2018-12-02 20:53:27,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:27,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:27,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:27,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:27,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:53:27,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:27,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 20:53:27,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:53:27,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:53:27,574 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 7 states. [2018-12-02 20:53:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:27,625 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-02 20:53:27,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:53:27,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-12-02 20:53:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:27,625 INFO L225 Difference]: With dead ends: 50 [2018-12-02 20:53:27,625 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 20:53:27,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:53:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 20:53:27,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-12-02 20:53:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 20:53:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-02 20:53:27,627 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 37 [2018-12-02 20:53:27,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:27,627 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-02 20:53:27,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 20:53:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-02 20:53:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 20:53:27,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:27,628 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-02 20:53:27,628 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:27,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:27,628 INFO L82 PathProgramCache]: Analyzing trace with hash -815318824, now seen corresponding path program 1 times [2018-12-02 20:53:27,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:27,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:27,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:27,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:27,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 20:53:27,700 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:27,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:53:27,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:53:27,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:53:27,701 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 8 states. [2018-12-02 20:53:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:27,743 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-02 20:53:27,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:53:27,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-12-02 20:53:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:27,743 INFO L225 Difference]: With dead ends: 48 [2018-12-02 20:53:27,743 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 20:53:27,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:53:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 20:53:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-02 20:53:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 20:53:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-02 20:53:27,745 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 37 [2018-12-02 20:53:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:27,745 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-02 20:53:27,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:53:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-02 20:53:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 20:53:27,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:27,746 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-02 20:53:27,746 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:27,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:27,746 INFO L82 PathProgramCache]: Analyzing trace with hash 494920192, now seen corresponding path program 1 times [2018-12-02 20:53:27,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:27,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:27,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:27,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:27,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 20:53:27,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:27,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 20:53:27,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 20:53:27,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:53:27,807 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2018-12-02 20:53:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:27,867 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-02 20:53:27,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 20:53:27,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-12-02 20:53:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:27,868 INFO L225 Difference]: With dead ends: 47 [2018-12-02 20:53:27,868 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 20:53:27,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-02 20:53:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 20:53:27,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-02 20:53:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 20:53:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-02 20:53:27,870 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 38 [2018-12-02 20:53:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:27,870 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-02 20:53:27,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 20:53:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-02 20:53:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 20:53:27,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:27,870 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] [2018-12-02 20:53:27,871 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:27,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:27,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1837343177, now seen corresponding path program 1 times [2018-12-02 20:53:27,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:27,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:27,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:27,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:27,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:27,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 20:53:27,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:27,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 20:53:27,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 20:53:27,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:53:27,938 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 11 states. [2018-12-02 20:53:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:28,038 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-02 20:53:28,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 20:53:28,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-12-02 20:53:28,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:28,039 INFO L225 Difference]: With dead ends: 47 [2018-12-02 20:53:28,039 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 20:53:28,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-02 20:53:28,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 20:53:28,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-02 20:53:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 20:53:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-02 20:53:28,041 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 39 [2018-12-02 20:53:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:28,042 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-02 20:53:28,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 20:53:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-02 20:53:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 20:53:28,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:28,042 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-02 20:53:28,043 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:28,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash 496519896, now seen corresponding path program 1 times [2018-12-02 20:53:28,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:28,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:28,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:53:28,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:28,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:53:28,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:28,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:53:28,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:53:28,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:53:28,068 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 5 states. [2018-12-02 20:53:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:28,072 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-12-02 20:53:28,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:53:28,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-02 20:53:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:28,073 INFO L225 Difference]: With dead ends: 46 [2018-12-02 20:53:28,073 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 20:53:28,074 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-02 20:53:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 20:53:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-02 20:53:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 20:53:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2018-12-02 20:53:28,075 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 38 [2018-12-02 20:53:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:28,076 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2018-12-02 20:53:28,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:53:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2018-12-02 20:53:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 20:53:28,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:53:28,076 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, 1] [2018-12-02 20:53:28,077 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 20:53:28,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:53:28,077 INFO L82 PathProgramCache]: Analyzing trace with hash 307586697, now seen corresponding path program 1 times [2018-12-02 20:53:28,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:53:28,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:28,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:53:28,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:53:28,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:53:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:53:28,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-02 20:53:28,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:53:28,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 20:53:28,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:53:28,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 20:53:28,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 20:53:28,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-12-02 20:53:28,262 INFO L87 Difference]: Start difference. First operand 46 states and 45 transitions. Second operand 14 states. [2018-12-02 20:53:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:53:28,455 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2018-12-02 20:53:28,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 20:53:28,456 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-12-02 20:53:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:53:28,456 INFO L225 Difference]: With dead ends: 45 [2018-12-02 20:53:28,456 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 20:53:28,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-02 20:53:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 20:53:28,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 20:53:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 20:53:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 20:53:28,457 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-12-02 20:53:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:53:28,457 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:53:28,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 20:53:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 20:53:28,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 20:53:28,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:53:28 BoogieIcfgContainer [2018-12-02 20:53:28,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 20:53:28,462 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:53:28,462 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:53:28,462 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:53:28,462 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:53:25" (3/4) ... [2018-12-02 20:53:28,465 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 20:53:28,470 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f6 [2018-12-02 20:53:28,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2018-12-02 20:53:28,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 20:53:28,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 20:53:28,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure disconnect_6 [2018-12-02 20:53:28,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2018-12-02 20:53:28,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g6 [2018-12-02 20:53:28,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure probe1_6 [2018-12-02 20:53:28,475 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-02 20:53:28,475 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 20:53:28,475 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 20:53:28,505 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a3a1cd34-3d05-4145-881e-4a97bf270978/bin-2019/utaipan/witness.graphml [2018-12-02 20:53:28,505 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:53:28,506 INFO L168 Benchmark]: Toolchain (without parser) took 3092.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 952.4 MB in the beginning and 954.7 MB in the end (delta: -2.3 MB). Peak memory consumption was 203.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:53:28,507 INFO L168 Benchmark]: CDTParser took 0.18 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-02 20:53:28,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -128.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-02 20:53:28,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.58 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-02 20:53:28,507 INFO L168 Benchmark]: Boogie Preprocessor took 17.55 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-02 20:53:28,507 INFO L168 Benchmark]: RCFGBuilder took 188.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-12-02 20:53:28,507 INFO L168 Benchmark]: TraceAbstraction took 2495.97 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 93.8 MB). Free memory was 1.0 GB in the beginning and 954.7 MB in the end (delta: 92.1 MB). Peak memory consumption was 185.9 MB. Max. memory is 11.5 GB. [2018-12-02 20:53:28,508 INFO L168 Benchmark]: Witness Printer took 43.73 ms. Allocated memory is still 1.2 GB. Free memory is still 954.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:53:28,509 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.18 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 322.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -128.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.58 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 17.55 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 188.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2495.97 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 93.8 MB). Free memory was 1.0 GB in the beginning and 954.7 MB in the end (delta: 92.1 MB). Peak memory consumption was 185.9 MB. Max. memory is 11.5 GB. * Witness Printer took 43.73 ms. Allocated memory is still 1.2 GB. Free memory is still 954.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1474]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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]: 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: 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 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 59 locations, 9 error locations. SAFE Result, 2.4s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 821 SDtfs, 313 SDslu, 2577 SDs, 0 SdLazy, 1383 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred 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, 17 MinimizatonAttempts, 44 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 82304 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...