./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_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_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/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 20fbdf1deafb883d59b25bfdcd58a0b89c69ce87 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/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 20fbdf1deafb883d59b25bfdcd58a0b89c69ce87 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 05:56:55,511 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:56:55,512 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:56:55,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:56:55,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:56:55,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:56:55,520 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:56:55,521 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:56:55,521 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:56:55,522 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:56:55,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:56:55,523 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:56:55,523 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:56:55,524 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:56:55,524 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:56:55,525 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:56:55,525 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:56:55,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:56:55,527 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:56:55,528 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:56:55,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:56:55,529 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:56:55,531 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:56:55,531 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:56:55,531 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:56:55,531 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:56:55,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:56:55,532 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:56:55,533 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:56:55,533 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:56:55,533 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:56:55,534 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:56:55,534 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:56:55,534 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:56:55,535 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:56:55,535 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:56:55,535 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 05:56:55,543 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:56:55,543 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:56:55,543 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:56:55,543 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:56:55,544 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 05:56:55,544 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 05:56:55,544 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 05:56:55,544 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 05:56:55,544 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 05:56:55,544 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 05:56:55,544 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 05:56:55,544 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 05:56:55,545 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 05:56:55,545 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:56:55,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:56:55,545 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:56:55,545 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:56:55,545 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 05:56:55,546 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:56:55,546 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:56:55,546 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:56:55,546 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 05:56:55,546 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 05:56:55,546 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 05:56:55,546 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:56:55,546 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:56:55,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:56:55,547 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:56:55,547 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:56:55,547 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:56:55,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:56:55,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:56:55,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:56:55,547 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 05:56:55,547 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:56:55,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 05:56:55,548 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_2404e2c7-a89d-4070-aa7d-adefc898efc2/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 -> 20fbdf1deafb883d59b25bfdcd58a0b89c69ce87 [2018-12-02 05:56:55,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:56:55,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:56:55,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:56:55,575 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:56:55,575 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:56:55,576 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-12-02 05:56:55,613 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/data/d9ba5956b/7b088bb6be1d4cf4bccd9d3e3e149a72/FLAG9c824959c [2018-12-02 05:56:56,021 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:56:56,021 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-12-02 05:56:56,029 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/data/d9ba5956b/7b088bb6be1d4cf4bccd9d3e3e149a72/FLAG9c824959c [2018-12-02 05:56:56,356 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/data/d9ba5956b/7b088bb6be1d4cf4bccd9d3e3e149a72 [2018-12-02 05:56:56,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:56:56,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:56:56,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:56:56,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:56:56,371 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:56:56,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:56:56" (1/1) ... [2018-12-02 05:56:56,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bdff3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:56:56, skipping insertion in model container [2018-12-02 05:56:56,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:56:56" (1/1) ... [2018-12-02 05:56:56,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:56:56,399 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:56:56,584 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:56:56,631 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:56:56,671 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:56:56,702 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:56:56,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:56:56 WrapperNode [2018-12-02 05:56:56,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:56:56,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:56:56,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:56:56,703 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:56:56,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:56:56" (1/1) ... [2018-12-02 05:56:56,719 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:56:56" (1/1) ... [2018-12-02 05:56:56,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:56:56,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:56:56,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:56:56,724 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:56:56,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:56:56" (1/1) ... [2018-12-02 05:56:56,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:56:56" (1/1) ... [2018-12-02 05:56:56,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:56:56" (1/1) ... [2018-12-02 05:56:56,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:56:56" (1/1) ... [2018-12-02 05:56:56,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:56:56" (1/1) ... [2018-12-02 05:56:56,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:56:56" (1/1) ... [2018-12-02 05:56:56,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:56:56" (1/1) ... [2018-12-02 05:56:56,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:56:56,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:56:56,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:56:56,742 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:56:56,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:56:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/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 05:56:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:56:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-12-02 05:56:56,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-12-02 05:56:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-12-02 05:56:56,776 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-12-02 05:56:56,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 05:56:56,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 05:56:56,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 05:56:56,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-12-02 05:56:56,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-12-02 05:56:56,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-02 05:56:56,776 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-02 05:56:56,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:56:56,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:56:56,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:56:56,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:56:56,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 05:56:56,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-12-02 05:56:56,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-12-02 05:56:56,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-12-02 05:56:56,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-12-02 05:56:56,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 05:56:56,777 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 05:56:56,777 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 05:56:56,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:56:56,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:56:56,889 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 05:56:56,958 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:56:56,958 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 05:56:56,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:56:56 BoogieIcfgContainer [2018-12-02 05:56:56,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:56:56,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:56:56,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:56:56,962 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:56:56,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:56:56" (1/3) ... [2018-12-02 05:56:56,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9a669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:56:56, skipping insertion in model container [2018-12-02 05:56:56,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:56:56" (2/3) ... [2018-12-02 05:56:56,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9a669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:56:56, skipping insertion in model container [2018-12-02 05:56:56,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:56:56" (3/3) ... [2018-12-02 05:56:56,965 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-12-02 05:56:56,974 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:56:56,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-02 05:56:56,993 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-02 05:56:57,009 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:56:57,009 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 05:56:57,009 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:56:57,009 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:56:57,009 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:56:57,009 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:56:57,009 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:56:57,009 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:56:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-12-02 05:56:57,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 05:56:57,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:56:57,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:56:57,026 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:56:57,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1361157941, now seen corresponding path program 1 times [2018-12-02 05:56:57,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:56:57,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:56:57,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:56:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:56:57,153 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 05:56:57,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:56:57,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:56:57,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:56:57,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:56:57,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:56:57,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:56:57,167 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 5 states. [2018-12-02 05:56:57,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:56:57,238 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-12-02 05:56:57,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:56:57,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 05:56:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:56:57,247 INFO L225 Difference]: With dead ends: 74 [2018-12-02 05:56:57,247 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 05:56:57,249 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 05:56:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 05:56:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-12-02 05:56:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 05:56:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-12-02 05:56:57,279 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 17 [2018-12-02 05:56:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:56:57,279 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-12-02 05:56:57,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:56:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-12-02 05:56:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 05:56:57,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:56:57,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:56:57,280 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:56:57,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1361157942, now seen corresponding path program 1 times [2018-12-02 05:56:57,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:56:57,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:56:57,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:56:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:56:57,346 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 05:56:57,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:56:57,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:56:57,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:56:57,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:56:57,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:56:57,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:56:57,348 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 6 states. [2018-12-02 05:56:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:56:57,417 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-12-02 05:56:57,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:56:57,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-02 05:56:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:56:57,418 INFO L225 Difference]: With dead ends: 70 [2018-12-02 05:56:57,418 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 05:56:57,419 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 05:56:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 05:56:57,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2018-12-02 05:56:57,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 05:56:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-12-02 05:56:57,423 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2018-12-02 05:56:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:56:57,423 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-12-02 05:56:57,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:56:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-12-02 05:56:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 05:56:57,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:56:57,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:56:57,424 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:56:57,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:57,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1389787092, now seen corresponding path program 1 times [2018-12-02 05:56:57,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:56:57,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:56:57,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:56:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:56:57,459 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 05:56:57,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:56:57,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:56:57,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:56:57,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:56:57,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:56:57,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:56:57,461 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 5 states. [2018-12-02 05:56:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:56:57,473 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-12-02 05:56:57,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:56:57,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 05:56:57,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:56:57,473 INFO L225 Difference]: With dead ends: 64 [2018-12-02 05:56:57,474 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 05:56:57,474 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 05:56:57,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 05:56:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-02 05:56:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 05:56:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-12-02 05:56:57,477 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 17 [2018-12-02 05:56:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:56:57,477 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-12-02 05:56:57,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:56:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-12-02 05:56:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 05:56:57,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:56:57,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:56:57,478 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:56:57,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1058628532, now seen corresponding path program 1 times [2018-12-02 05:56:57,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:56:57,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:56:57,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:56:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:56:57,507 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 05:56:57,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:56:57,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:56:57,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:56:57,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:56:57,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:56:57,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:56:57,508 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2018-12-02 05:56:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:56:57,518 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-02 05:56:57,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:56:57,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 05:56:57,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:56:57,519 INFO L225 Difference]: With dead ends: 64 [2018-12-02 05:56:57,519 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 05:56:57,519 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 05:56:57,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 05:56:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-02 05:56:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 05:56:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-12-02 05:56:57,523 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 22 [2018-12-02 05:56:57,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:56:57,523 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-12-02 05:56:57,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:56:57,523 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-12-02 05:56:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 05:56:57,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:56:57,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:56:57,524 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:56:57,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1439387405, now seen corresponding path program 1 times [2018-12-02 05:56:57,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:56:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:56:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:56:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:56:57,548 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 05:56:57,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:56:57,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:56:57,548 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:56:57,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:56:57,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:56:57,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:56:57,549 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 3 states. [2018-12-02 05:56:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:56:57,590 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-02 05:56:57,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:56:57,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 05:56:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:56:57,591 INFO L225 Difference]: With dead ends: 68 [2018-12-02 05:56:57,591 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 05:56:57,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:56:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 05:56:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-02 05:56:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 05:56:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-02 05:56:57,594 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 22 [2018-12-02 05:56:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:56:57,595 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-02 05:56:57,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:56:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-02 05:56:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 05:56:57,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:56:57,596 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 05:56:57,596 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:56:57,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:57,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1937675523, now seen corresponding path program 1 times [2018-12-02 05:56:57,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:56:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:56:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:56:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:56:57,691 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 05:56:57,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:56:57,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:56:57,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:56:57,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:56:57,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:56:57,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:56:57,692 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 11 states. [2018-12-02 05:56:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:56:57,850 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-02 05:56:57,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:56:57,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-12-02 05:56:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:56:57,851 INFO L225 Difference]: With dead ends: 57 [2018-12-02 05:56:57,851 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 05:56:57,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:56:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 05:56:57,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-02 05:56:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 05:56:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-12-02 05:56:57,854 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 32 [2018-12-02 05:56:57,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:56:57,854 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-12-02 05:56:57,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:56:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-12-02 05:56:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 05:56:57,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:56:57,855 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 05:56:57,855 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:56:57,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:57,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1937675522, now seen corresponding path program 1 times [2018-12-02 05:56:57,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:56:57,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:56:57,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:57,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:56:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:56:57,925 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 05:56:57,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:56:57,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:56:57,926 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:56:57,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:56:57,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:56:57,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:56:57,927 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 9 states. [2018-12-02 05:56:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:56:58,019 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-02 05:56:58,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:56:58,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-02 05:56:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:56:58,020 INFO L225 Difference]: With dead ends: 60 [2018-12-02 05:56:58,020 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 05:56:58,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:56:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 05:56:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-02 05:56:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 05:56:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-02 05:56:58,023 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 32 [2018-12-02 05:56:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:56:58,024 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-02 05:56:58,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:56:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-02 05:56:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 05:56:58,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:56:58,025 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] [2018-12-02 05:56:58,025 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:56:58,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:58,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1956552744, now seen corresponding path program 1 times [2018-12-02 05:56:58,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:56:58,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:58,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:56:58,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:58,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:56:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:56:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:56:58,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:56:58,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:56:58,118 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-12-02 05:56:58,119 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [7], [11], [15], [19], [20], [24], [26], [27], [39], [42], [44], [45], [50], [53], [54], [58], [62], [66], [70], [71], [72], [73], [74], [76], [78], [80], [81], [82], [84], [86] [2018-12-02 05:56:58,144 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:56:58,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:56:58,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 05:56:58,269 INFO L272 AbstractInterpreter]: Visited 33 different actions 41 times. Merged at 3 different actions 5 times. Never widened. Performed 352 root evaluator evaluations with a maximum evaluation depth of 4. Performed 352 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 25 variables. [2018-12-02 05:56:58,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:58,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 05:56:58,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:56:58,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:56:58,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:56:58,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:56:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:56:58,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:56:58,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:56:58,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:56:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:56:58,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:56:58,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 16 [2018-12-02 05:56:58,465 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:56:58,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:56:58,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:56:58,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:56:58,466 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 13 states. [2018-12-02 05:56:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:56:58,607 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-12-02 05:56:58,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:56:58,607 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-02 05:56:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:56:58,608 INFO L225 Difference]: With dead ends: 61 [2018-12-02 05:56:58,608 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 05:56:58,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-12-02 05:56:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 05:56:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-02 05:56:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 05:56:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-12-02 05:56:58,612 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 33 [2018-12-02 05:56:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:56:58,612 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-12-02 05:56:58,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:56:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-12-02 05:56:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 05:56:58,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:56:58,613 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:56:58,613 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:56:58,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:58,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1876422594, now seen corresponding path program 2 times [2018-12-02 05:56:58,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:56:58,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:58,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:56:58,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:58,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:56:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:56:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:56:58,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:56:58,707 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:56:58,707 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:56:58,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:56:58,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:56:58,707 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:56:58,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:56:58,713 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 05:56:58,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 05:56:58,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:56:58,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:56:58,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 05:56:58,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:56:58,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:56:58,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-02 05:56:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 05:56:58,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:56:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 05:56:59,148 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 05:56:59,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [11] total 32 [2018-12-02 05:56:59,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:56:59,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:56:59,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:56:59,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2018-12-02 05:56:59,150 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 13 states. [2018-12-02 05:56:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:56:59,330 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-12-02 05:56:59,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:56:59,330 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-12-02 05:56:59,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:56:59,330 INFO L225 Difference]: With dead ends: 58 [2018-12-02 05:56:59,330 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 05:56:59,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=1150, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 05:56:59,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 05:56:59,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-02 05:56:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 05:56:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-02 05:56:59,333 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 34 [2018-12-02 05:56:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:56:59,333 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-02 05:56:59,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:56:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-02 05:56:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 05:56:59,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:56:59,334 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:56:59,334 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:56:59,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:59,334 INFO L82 PathProgramCache]: Analyzing trace with hash -47845941, now seen corresponding path program 1 times [2018-12-02 05:56:59,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:56:59,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:59,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:56:59,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:59,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:56:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:56:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 05:56:59,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:56:59,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:56:59,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:56:59,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:56:59,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:56:59,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:56:59,393 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 11 states. [2018-12-02 05:56:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:56:59,517 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-12-02 05:56:59,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:56:59,518 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-12-02 05:56:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:56:59,518 INFO L225 Difference]: With dead ends: 56 [2018-12-02 05:56:59,518 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 05:56:59,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:56:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 05:56:59,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-02 05:56:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 05:56:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-02 05:56:59,521 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 39 [2018-12-02 05:56:59,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:56:59,521 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-02 05:56:59,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:56:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-02 05:56:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 05:56:59,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:56:59,522 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:56:59,522 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:56:59,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:59,522 INFO L82 PathProgramCache]: Analyzing trace with hash -47845940, now seen corresponding path program 1 times [2018-12-02 05:56:59,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:56:59,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:59,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:56:59,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:59,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:56:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:56:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:56:59,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:56:59,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:56:59,611 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-02 05:56:59,611 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [11], [15], [19], [20], [24], [26], [27], [31], [34], [39], [42], [44], [45], [50], [53], [54], [58], [62], [66], [70], [71], [72], [73], [74], [76], [78], [80], [81], [82], [84], [86], [87], [88] [2018-12-02 05:56:59,612 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:56:59,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:56:59,673 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 05:56:59,673 INFO L272 AbstractInterpreter]: Visited 38 different actions 50 times. Merged at 3 different actions 8 times. Widened at 1 different actions 1 times. Performed 422 root evaluator evaluations with a maximum evaluation depth of 4. Performed 422 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 2 different actions. Largest state had 25 variables. [2018-12-02 05:56:59,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:59,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 05:56:59,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:56:59,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:56:59,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:56:59,687 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:56:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:56:59,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:56:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:56:59,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:56:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:56:59,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:56:59,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 19 [2018-12-02 05:56:59,837 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:56:59,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 05:56:59,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 05:56:59,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-12-02 05:56:59,837 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 15 states. [2018-12-02 05:56:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:56:59,968 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-12-02 05:56:59,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:56:59,969 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-12-02 05:56:59,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:56:59,969 INFO L225 Difference]: With dead ends: 59 [2018-12-02 05:56:59,969 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 05:56:59,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-12-02 05:56:59,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 05:56:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-02 05:56:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 05:56:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-12-02 05:56:59,973 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 39 [2018-12-02 05:56:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:56:59,973 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-12-02 05:56:59,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 05:56:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-12-02 05:56:59,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 05:56:59,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:56:59,974 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:59,974 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:56:59,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:56:59,975 INFO L82 PathProgramCache]: Analyzing trace with hash -744196766, now seen corresponding path program 2 times [2018-12-02 05:56:59,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:56:59,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:59,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:56:59,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:56:59,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:56:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:00,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:00,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:00,084 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:57:00,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:57:00,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:00,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:00,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:57:00,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 05:57:00,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 05:57:00,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:57:00,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:00,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 05:57:00,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:57:00,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:57:00,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-02 05:57:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 05:57:00,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 05:57:00,545 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 05:57:00,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [12] total 33 [2018-12-02 05:57:00,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:57:00,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:57:00,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:57:00,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=968, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 05:57:00,546 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 13 states. [2018-12-02 05:57:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:00,727 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-12-02 05:57:00,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:57:00,727 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-12-02 05:57:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:00,727 INFO L225 Difference]: With dead ends: 55 [2018-12-02 05:57:00,727 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 05:57:00,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=1217, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 05:57:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 05:57:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-02 05:57:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 05:57:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-12-02 05:57:00,730 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 40 [2018-12-02 05:57:00,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:00,730 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-12-02 05:57:00,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:57:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-12-02 05:57:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 05:57:00,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:00,731 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:00,731 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:00,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1067944240, now seen corresponding path program 1 times [2018-12-02 05:57:00,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:00,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:00,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:57:00,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:00,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 05:57:00,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:57:00,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:57:00,756 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:57:00,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:57:00,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:57:00,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:57:00,757 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 7 states. [2018-12-02 05:57:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:00,778 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-12-02 05:57:00,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:57:00,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-12-02 05:57:00,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:00,778 INFO L225 Difference]: With dead ends: 57 [2018-12-02 05:57:00,778 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 05:57:00,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:57:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 05:57:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-02 05:57:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 05:57:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-02 05:57:00,780 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 38 [2018-12-02 05:57:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:00,780 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-02 05:57:00,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:57:00,780 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-02 05:57:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 05:57:00,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:00,781 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:00,781 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:00,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:00,781 INFO L82 PathProgramCache]: Analyzing trace with hash -189517611, now seen corresponding path program 1 times [2018-12-02 05:57:00,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:00,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:00,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:00,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:00,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 05:57:00,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:57:00,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:57:00,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:57:00,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:57:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:57:00,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:57:00,825 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 9 states. [2018-12-02 05:57:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:00,860 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-02 05:57:00,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:57:00,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-12-02 05:57:00,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:00,861 INFO L225 Difference]: With dead ends: 59 [2018-12-02 05:57:00,861 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 05:57:00,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:57:00,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 05:57:00,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-02 05:57:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 05:57:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-02 05:57:00,863 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 43 [2018-12-02 05:57:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:00,863 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-02 05:57:00,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:57:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-02 05:57:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 05:57:00,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:00,864 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:00,864 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:00,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1274775663, now seen corresponding path program 1 times [2018-12-02 05:57:00,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:00,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:00,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:00,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:00,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:00,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:00,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:00,946 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-12-02 05:57:00,946 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [11], [15], [17], [18], [19], [20], [24], [26], [27], [30], [31], [32], [35], [38], [39], [42], [44], [45], [50], [52], [53], [54], [58], [60], [61], [62], [66], [69], [70], [71], [72], [73], [74], [75], [76], [77], [78], [79], [80], [81], [82], [84], [85], [86], [87], [88], [89] [2018-12-02 05:57:00,948 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:57:00,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:57:00,988 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 05:57:00,988 INFO L272 AbstractInterpreter]: Visited 52 different actions 64 times. Merged at 3 different actions 8 times. Widened at 1 different actions 1 times. Performed 459 root evaluator evaluations with a maximum evaluation depth of 4. Performed 459 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-12-02 05:57:00,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:00,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 05:57:00,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:00,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:00,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:00,999 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:57:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:01,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:01,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:01,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:57:01,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 22 [2018-12-02 05:57:01,233 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:57:01,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:57:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:57:01,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-12-02 05:57:01,234 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 17 states. [2018-12-02 05:57:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:01,380 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-02 05:57:01,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:57:01,380 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-12-02 05:57:01,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:01,380 INFO L225 Difference]: With dead ends: 58 [2018-12-02 05:57:01,380 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 05:57:01,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2018-12-02 05:57:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 05:57:01,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-02 05:57:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 05:57:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-02 05:57:01,382 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-02 05:57:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:01,382 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-02 05:57:01,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:57:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-02 05:57:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 05:57:01,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:01,383 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:01,383 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:01,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:01,383 INFO L82 PathProgramCache]: Analyzing trace with hash 20324889, now seen corresponding path program 2 times [2018-12-02 05:57:01,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:01,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:01,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:01,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:01,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:01,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:01,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:01,473 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:57:01,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:57:01,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:01,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:01,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:57:01,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 05:57:01,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 05:57:01,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:57:01,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:01,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:01,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:57:01,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2018-12-02 05:57:01,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:57:01,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 05:57:01,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 05:57:01,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-12-02 05:57:01,747 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 19 states. [2018-12-02 05:57:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:02,035 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-02 05:57:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:57:02,035 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-02 05:57:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:02,036 INFO L225 Difference]: With dead ends: 59 [2018-12-02 05:57:02,036 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 05:57:02,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-12-02 05:57:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 05:57:02,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-02 05:57:02,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 05:57:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-02 05:57:02,039 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-02 05:57:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:02,039 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-02 05:57:02,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 05:57:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-02 05:57:02,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 05:57:02,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:02,040 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:02,040 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:02,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:02,040 INFO L82 PathProgramCache]: Analyzing trace with hash -212943441, now seen corresponding path program 3 times [2018-12-02 05:57:02,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:02,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:02,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:57:02,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:02,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:02,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:02,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:02,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:57:02,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:57:02,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:02,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:02,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 05:57:02,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 05:57:02,186 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 05:57:02,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:57:02,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:02,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:02,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:57:02,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2018-12-02 05:57:02,432 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:57:02,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 05:57:02,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 05:57:02,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2018-12-02 05:57:02,432 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 21 states. [2018-12-02 05:57:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:02,631 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-02 05:57:02,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:57:02,632 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-12-02 05:57:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:02,632 INFO L225 Difference]: With dead ends: 60 [2018-12-02 05:57:02,632 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 05:57:02,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 05:57:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 05:57:02,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-02 05:57:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 05:57:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-02 05:57:02,634 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-02 05:57:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:02,634 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-02 05:57:02,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 05:57:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-02 05:57:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 05:57:02,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:02,634 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:02,634 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:02,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:02,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1145672921, now seen corresponding path program 4 times [2018-12-02 05:57:02,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:02,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:57:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:02,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:02,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:02,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:02,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:57:02,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:57:02,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:02,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:02,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:02,744 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:57:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:02,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:02,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:03,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:57:03,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 31 [2018-12-02 05:57:03,087 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:57:03,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 05:57:03,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 05:57:03,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2018-12-02 05:57:03,088 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 23 states. [2018-12-02 05:57:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:03,312 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-02 05:57:03,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:57:03,313 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-12-02 05:57:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:03,313 INFO L225 Difference]: With dead ends: 61 [2018-12-02 05:57:03,313 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 05:57:03,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=344, Invalid=1138, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 05:57:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 05:57:03,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-02 05:57:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 05:57:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-02 05:57:03,316 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-02 05:57:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:03,316 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-02 05:57:03,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 05:57:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-02 05:57:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 05:57:03,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:03,317 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:03,317 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:03,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:03,317 INFO L82 PathProgramCache]: Analyzing trace with hash 313107183, now seen corresponding path program 5 times [2018-12-02 05:57:03,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:03,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:03,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:03,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:03,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:03,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:03,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:03,421 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:57:03,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:57:03,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:03,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:03,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:57:03,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 05:57:03,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 05:57:03,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:57:03,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:03,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:04,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:57:04,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 34 [2018-12-02 05:57:04,234 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:57:04,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-02 05:57:04,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 05:57:04,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 05:57:04,235 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 25 states. [2018-12-02 05:57:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:04,481 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-02 05:57:04,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 05:57:04,482 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2018-12-02 05:57:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:04,482 INFO L225 Difference]: With dead ends: 62 [2018-12-02 05:57:04,482 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 05:57:04,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=429, Invalid=1377, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 05:57:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 05:57:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-02 05:57:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 05:57:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-02 05:57:04,484 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-02 05:57:04,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:04,484 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-02 05:57:04,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-02 05:57:04,484 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-02 05:57:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 05:57:04,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:04,484 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:04,484 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:04,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:04,484 INFO L82 PathProgramCache]: Analyzing trace with hash 273373081, now seen corresponding path program 6 times [2018-12-02 05:57:04,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:04,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:04,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:57:04,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:04,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:04,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:04,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:04,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:57:04,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:57:04,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:04,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:04,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 05:57:04,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 05:57:04,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 05:57:04,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:57:04,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:04,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:05,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:57:05,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 37 [2018-12-02 05:57:05,059 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:57:05,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-02 05:57:05,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-02 05:57:05,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 05:57:05,060 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 27 states. [2018-12-02 05:57:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:05,805 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-02 05:57:05,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 05:57:05,806 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-12-02 05:57:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:05,807 INFO L225 Difference]: With dead ends: 63 [2018-12-02 05:57:05,807 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 05:57:05,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=522, Invalid=1640, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 05:57:05,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 05:57:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-02 05:57:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 05:57:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-02 05:57:05,813 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-02 05:57:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:05,813 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-02 05:57:05,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-02 05:57:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-02 05:57:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 05:57:05,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:05,815 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:05,816 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:05,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:05,816 INFO L82 PathProgramCache]: Analyzing trace with hash -958384081, now seen corresponding path program 7 times [2018-12-02 05:57:05,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:05,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:05,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:57:05,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:05,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:05,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:05,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:05,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:57:05,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:57:05,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:05,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:05,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:05,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:57:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:06,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:06,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:06,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:57:06,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 40 [2018-12-02 05:57:06,456 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:57:06,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 05:57:06,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 05:57:06,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1212, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 05:57:06,457 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 29 states. [2018-12-02 05:57:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:06,758 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-02 05:57:06,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 05:57:06,758 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2018-12-02 05:57:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:06,759 INFO L225 Difference]: With dead ends: 64 [2018-12-02 05:57:06,759 INFO L226 Difference]: Without dead ends: 62 [2018-12-02 05:57:06,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=617, Invalid=1933, Unknown=0, NotChecked=0, Total=2550 [2018-12-02 05:57:06,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-02 05:57:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-02 05:57:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 05:57:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-02 05:57:06,760 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-02 05:57:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:06,761 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-02 05:57:06,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 05:57:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-02 05:57:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 05:57:06,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:06,761 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:06,761 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:06,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash -488150439, now seen corresponding path program 8 times [2018-12-02 05:57:06,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:06,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:06,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:06,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:06,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:06,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:06,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:06,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:57:06,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:57:06,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:06,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:06,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:57:06,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 05:57:08,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 05:57:08,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:57:08,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:08,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:08,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:57:08,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 43 [2018-12-02 05:57:08,779 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:57:08,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 05:57:08,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 05:57:08,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=1406, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 05:57:08,780 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 31 states. [2018-12-02 05:57:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:09,091 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-02 05:57:09,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 05:57:09,091 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 61 [2018-12-02 05:57:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:09,091 INFO L225 Difference]: With dead ends: 65 [2018-12-02 05:57:09,091 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 05:57:09,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=714, Invalid=2256, Unknown=0, NotChecked=0, Total=2970 [2018-12-02 05:57:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 05:57:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-02 05:57:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 05:57:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-02 05:57:09,093 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-02 05:57:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:09,093 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-02 05:57:09,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 05:57:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-02 05:57:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 05:57:09,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:09,094 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:09,094 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:09,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:09,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1204190575, now seen corresponding path program 9 times [2018-12-02 05:57:09,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:09,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:09,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:57:09,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:09,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:09,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:09,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:09,279 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:57:09,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:57:09,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:09,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:09,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 05:57:09,285 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 05:57:09,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 05:57:09,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:57:09,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:09,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:09,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:57:09,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 46 [2018-12-02 05:57:09,864 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:57:09,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 05:57:09,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 05:57:09,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1617, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 05:57:09,865 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2018-12-02 05:57:10,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:10,301 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-02 05:57:10,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:57:10,302 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2018-12-02 05:57:10,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:10,302 INFO L225 Difference]: With dead ends: 66 [2018-12-02 05:57:10,302 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 05:57:10,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=813, Invalid=2609, Unknown=0, NotChecked=0, Total=3422 [2018-12-02 05:57:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 05:57:10,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-02 05:57:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-02 05:57:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-02 05:57:10,306 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-02 05:57:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:10,307 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-02 05:57:10,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 05:57:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-02 05:57:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 05:57:10,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:10,308 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:10,309 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:10,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:10,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2127154457, now seen corresponding path program 10 times [2018-12-02 05:57:10,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:10,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:10,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:57:10,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:10,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:10,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:10,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:10,494 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:57:10,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:57:10,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:10,495 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:10,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:10,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:57:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:10,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:10,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:11,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:57:11,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 16] total 49 [2018-12-02 05:57:11,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:57:11,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-02 05:57:11,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-02 05:57:11,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1845, Unknown=0, NotChecked=0, Total=2352 [2018-12-02 05:57:11,093 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 35 states. [2018-12-02 05:57:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:11,528 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-02 05:57:11,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 05:57:11,529 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2018-12-02 05:57:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:11,529 INFO L225 Difference]: With dead ends: 67 [2018-12-02 05:57:11,529 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 05:57:11,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=914, Invalid=2992, Unknown=0, NotChecked=0, Total=3906 [2018-12-02 05:57:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 05:57:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-02 05:57:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 05:57:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-02 05:57:11,532 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-02 05:57:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:11,532 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-02 05:57:11,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-02 05:57:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-02 05:57:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 05:57:11,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:11,532 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:11,532 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:11,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:11,533 INFO L82 PathProgramCache]: Analyzing trace with hash 674263727, now seen corresponding path program 11 times [2018-12-02 05:57:11,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:11,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:11,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:11,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:11,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:11,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:11,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:11,713 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:57:11,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:57:11,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:11,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:11,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:57:11,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 05:57:13,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-02 05:57:13,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:57:13,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:14,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:14,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:57:14,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 52 [2018-12-02 05:57:14,518 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:57:14,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-02 05:57:14,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-02 05:57:14,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=562, Invalid=2090, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 05:57:14,519 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 37 states. [2018-12-02 05:57:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:14,936 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-02 05:57:14,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 05:57:14,937 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 64 [2018-12-02 05:57:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:14,937 INFO L225 Difference]: With dead ends: 68 [2018-12-02 05:57:14,937 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 05:57:14,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1017, Invalid=3405, Unknown=0, NotChecked=0, Total=4422 [2018-12-02 05:57:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 05:57:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-02 05:57:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 05:57:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-02 05:57:14,939 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-02 05:57:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:14,939 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-02 05:57:14,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-02 05:57:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-02 05:57:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 05:57:14,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:14,940 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:14,940 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:14,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:14,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1415675943, now seen corresponding path program 12 times [2018-12-02 05:57:14,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:14,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:14,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:57:14,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:14,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:15,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:15,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:15,132 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:57:15,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:57:15,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:15,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:15,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 05:57:15,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 05:57:15,169 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 05:57:15,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:57:15,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:15,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:15,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:57:15,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 18] total 55 [2018-12-02 05:57:15,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:57:15,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-02 05:57:15,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-02 05:57:15,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=2352, Unknown=0, NotChecked=0, Total=2970 [2018-12-02 05:57:15,875 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 39 states. [2018-12-02 05:57:16,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:16,292 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-02 05:57:16,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 05:57:16,292 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 65 [2018-12-02 05:57:16,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:16,293 INFO L225 Difference]: With dead ends: 69 [2018-12-02 05:57:16,293 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 05:57:16,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1122, Invalid=3848, Unknown=0, NotChecked=0, Total=4970 [2018-12-02 05:57:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 05:57:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-02 05:57:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 05:57:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-02 05:57:16,295 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-02 05:57:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:16,295 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-02 05:57:16,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-02 05:57:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-02 05:57:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 05:57:16,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:16,295 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:16,295 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:16,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:16,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1779296273, now seen corresponding path program 13 times [2018-12-02 05:57:16,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:16,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:57:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:16,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:16,483 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:16,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:16,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:57:16,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:57:16,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:57:16,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:16,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:16,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:16,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:57:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:16,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:16,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:17,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:57:17,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 19] total 57 [2018-12-02 05:57:17,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:57:17,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-02 05:57:17,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-02 05:57:17,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=656, Invalid=2536, Unknown=0, NotChecked=0, Total=3192 [2018-12-02 05:57:17,233 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 41 states. [2018-12-02 05:57:18,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:18,076 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-02 05:57:18,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 05:57:18,076 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 66 [2018-12-02 05:57:18,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:18,077 INFO L225 Difference]: With dead ends: 70 [2018-12-02 05:57:18,077 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 05:57:18,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1209, Invalid=4193, Unknown=0, NotChecked=0, Total=5402 [2018-12-02 05:57:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 05:57:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-02 05:57:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 05:57:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-02 05:57:18,079 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-02 05:57:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:18,079 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-02 05:57:18,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-02 05:57:18,079 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-02 05:57:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:57:18,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:18,079 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:18,080 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION]=== [2018-12-02 05:57:18,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash -166624615, now seen corresponding path program 14 times [2018-12-02 05:57:18,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:57:18,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:18,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:18,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:57:18,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:57:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:57:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:57:18,126 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 05:57:18,137 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-12-02 05:57:18,139 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 05:57:18,146 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 05:57:18,147 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 18 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 05:57:18,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:57:18 BoogieIcfgContainer [2018-12-02 05:57:18,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:57:18,153 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:57:18,153 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:57:18,153 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:57:18,153 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:56:56" (3/4) ... [2018-12-02 05:57:18,155 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 05:57:18,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:57:18,156 INFO L168 Benchmark]: Toolchain (without parser) took 21793.46 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 478.7 MB). Free memory was 945.9 MB in the beginning and 1.4 GB in the end (delta: -476.3 MB). Peak memory consumption was 2.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:57:18,157 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:57:18,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2018-12-02 05:57:18,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:57:18,157 INFO L168 Benchmark]: Boogie Preprocessor took 17.85 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 05:57:18,158 INFO L168 Benchmark]: RCFGBuilder took 217.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-12-02 05:57:18,158 INFO L168 Benchmark]: TraceAbstraction took 21192.88 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 362.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -357.5 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. [2018-12-02 05:57:18,158 INFO L168 Benchmark]: Witness Printer took 2.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:57:18,159 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.85 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 217.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21192.88 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 362.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -357.5 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 18 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1441]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1441. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={1:0}] [L1442] CALL entry_point() VAL [ldv_global_msg_list={1:0}] [L1436] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={1:0}] [L1437] CALL, EXPR ldv_kobject_create() VAL [ldv_global_msg_list={1:0}] [L1406] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={1:0}] [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16, ldv_global_msg_list={1:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=16, \result={22:0}, ldv_global_msg_list={1:0}, malloc(size)={22:0}, size=16] [L1408] RET, EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_global_msg_list={1:0}, ldv_malloc(sizeof(*kobj))={22:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) VAL [kobj={22:0}, ldv_global_msg_list={1:0}] [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) VAL [kobj={22:0}, ldv_global_msg_list={1:0}, memset(kobj, 0, sizeof(*kobj))={22:0}] [L1413] CALL ldv_kobject_init(kobj) VAL [kobj={22:0}, ldv_global_msg_list={1:0}] [L1394] COND FALSE !(!kobj) VAL [kobj={22:0}, kobj={22:0}, ldv_global_msg_list={1:0}] [L1398] CALL ldv_kobject_init_internal(kobj) VAL [kobj={22:0}, ldv_global_msg_list={1:0}] [L1380] COND FALSE !(!kobj) VAL [kobj={22:0}, kobj={22:0}, ldv_global_msg_list={1:0}] [L1382] CALL ldv_kref_init(&kobj->kref) VAL [kref={22:12}, ldv_global_msg_list={1:0}] [L1294] ((&kref->refcount)->counter) = (1) VAL [kref={22:12}, kref={22:12}, ldv_global_msg_list={1:0}] [L1382] RET ldv_kref_init(&kobj->kref) VAL [kobj={22:0}, kobj={22:0}, ldv_global_msg_list={1:0}] [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [ldv_global_msg_list={1:0}, list={22:4}] [L1099] list->next = list VAL [ldv_global_msg_list={1:0}, list={22:4}, list={22:4}] [L1100] list->prev = list VAL [ldv_global_msg_list={1:0}, list={22:4}, list={22:4}] [L1383] RET LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={22:0}, kobj={22:0}, ldv_global_msg_list={1:0}] [L1398] RET ldv_kobject_init_internal(kobj) VAL [kobj={22:0}, kobj={22:0}, ldv_global_msg_list={1:0}] [L1413] RET ldv_kobject_init(kobj) VAL [kobj={22:0}, ldv_global_msg_list={1:0}] [L1414] return kobj; VAL [\result={22:0}, kobj={22:0}, ldv_global_msg_list={1:0}] [L1437] RET, EXPR ldv_kobject_create() VAL [ldv_global_msg_list={1:0}, ldv_kobject_create()={22:0}] [L1437] kobj = ldv_kobject_create() [L1442] RET entry_point() VAL [ldv_global_msg_list={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 63 locations, 9 error locations. UNSAFE Result, 21.1s OverallTime, 28 OverallIterations, 16 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1252 SDtfs, 422 SDslu, 13849 SDs, 0 SdLazy, 6156 SolverSat, 224 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2387 GetRequests, 1559 SyntacticMatches, 22 SemanticMatches, 806 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6045 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 2198 NumberOfCodeBlocks, 2193 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 2996 ConstructedInterpolants, 19 QuantifiedInterpolants, 419490 SizeOfPredicates, 35 NumberOfNonLiveVariables, 4682 ConjunctsInSsa, 249 ConjunctsInUnsatCore, 61 InterpolantComputations, 14 PerfectInterpolantSequences, 33/2082 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 05:57:19,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:57:19,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:57:19,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:57:19,460 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:57:19,460 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:57:19,461 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:57:19,462 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:57:19,463 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:57:19,463 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:57:19,464 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:57:19,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:57:19,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:57:19,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:57:19,466 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:57:19,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:57:19,466 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:57:19,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:57:19,468 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:57:19,469 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:57:19,470 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:57:19,470 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:57:19,471 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:57:19,472 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:57:19,472 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:57:19,472 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:57:19,473 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:57:19,473 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:57:19,474 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:57:19,474 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:57:19,475 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:57:19,475 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:57:19,475 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:57:19,475 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:57:19,476 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:57:19,477 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:57:19,477 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-02 05:57:19,485 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:57:19,485 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:57:19,486 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:57:19,486 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:57:19,486 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 05:57:19,486 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 05:57:19,486 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 05:57:19,486 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 05:57:19,486 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 05:57:19,487 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 05:57:19,487 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:57:19,487 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:57:19,487 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:57:19,487 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:57:19,488 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 05:57:19,488 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:57:19,488 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:57:19,488 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:57:19,488 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 05:57:19,488 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 05:57:19,488 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 05:57:19,488 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:57:19,489 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 05:57:19,489 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 05:57:19,489 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:57:19,489 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:57:19,489 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:57:19,489 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:57:19,489 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:57:19,489 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:57:19,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:57:19,490 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:57:19,490 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:57:19,490 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 05:57:19,490 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:57:19,490 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 05:57:19,490 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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_2404e2c7-a89d-4070-aa7d-adefc898efc2/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 -> 20fbdf1deafb883d59b25bfdcd58a0b89c69ce87 [2018-12-02 05:57:19,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:57:19,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:57:19,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:57:19,526 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:57:19,526 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:57:19,527 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-12-02 05:57:19,574 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/data/576bbf484/21e9dd1846dc41df9ae32bbeaeedccb7/FLAG9df032e59 [2018-12-02 05:57:20,082 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:57:20,083 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-12-02 05:57:20,092 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/data/576bbf484/21e9dd1846dc41df9ae32bbeaeedccb7/FLAG9df032e59 [2018-12-02 05:57:20,560 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/data/576bbf484/21e9dd1846dc41df9ae32bbeaeedccb7 [2018-12-02 05:57:20,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:57:20,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:57:20,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:57:20,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:57:20,567 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:57:20,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:57:20" (1/1) ... [2018-12-02 05:57:20,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397a44ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:20, skipping insertion in model container [2018-12-02 05:57:20,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:57:20" (1/1) ... [2018-12-02 05:57:20,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:57:20,599 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:57:20,791 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:57:20,806 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:57:20,879 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:57:20,912 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:57:20,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:20 WrapperNode [2018-12-02 05:57:20,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:57:20,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:57:20,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:57:20,914 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:57:20,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:20" (1/1) ... [2018-12-02 05:57:20,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:20" (1/1) ... [2018-12-02 05:57:20,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:57:20,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:57:20,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:57:20,935 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:57:20,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:20" (1/1) ... [2018-12-02 05:57:20,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:20" (1/1) ... [2018-12-02 05:57:20,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:20" (1/1) ... [2018-12-02 05:57:20,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:20" (1/1) ... [2018-12-02 05:57:20,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:20" (1/1) ... [2018-12-02 05:57:20,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:20" (1/1) ... [2018-12-02 05:57:20,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:20" (1/1) ... [2018-12-02 05:57:20,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:57:20,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:57:20,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:57:20,955 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:57:20,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/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 05:57:20,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:57:20,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-12-02 05:57:20,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-12-02 05:57:20,986 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-12-02 05:57:20,986 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-12-02 05:57:20,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 05:57:20,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 05:57:20,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-12-02 05:57:20,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-12-02 05:57:20,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-02 05:57:20,986 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-02 05:57:20,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:57:20,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:57:20,987 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:57:20,987 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:57:20,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 05:57:20,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-12-02 05:57:20,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-12-02 05:57:20,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 05:57:20,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-12-02 05:57:20,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-12-02 05:57:20,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 05:57:20,988 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 05:57:20,988 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 05:57:20,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:57:20,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:57:21,110 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 05:57:21,190 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:57:21,190 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 05:57:21,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:57:21 BoogieIcfgContainer [2018-12-02 05:57:21,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:57:21,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:57:21,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:57:21,193 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:57:21,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:57:20" (1/3) ... [2018-12-02 05:57:21,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63da9692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:57:21, skipping insertion in model container [2018-12-02 05:57:21,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:20" (2/3) ... [2018-12-02 05:57:21,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63da9692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:57:21, skipping insertion in model container [2018-12-02 05:57:21,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:57:21" (3/3) ... [2018-12-02 05:57:21,195 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-12-02 05:57:21,201 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:57:21,205 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-02 05:57:21,214 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-02 05:57:21,227 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:57:21,228 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:57:21,228 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 05:57:21,228 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:57:21,228 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:57:21,228 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:57:21,228 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:57:21,228 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:57:21,228 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:57:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-12-02 05:57:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 05:57:21,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:21,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:57:21,243 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION]=== [2018-12-02 05:57:21,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:21,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1361157941, now seen corresponding path program 1 times [2018-12-02 05:57:21,249 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:57:21,249 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:57:21,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:21,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:21,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 05:57:21,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:57:21,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:57:21,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:57:21,379 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 05:57:21,380 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:57:21,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:57:21,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:57:21,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:57:21,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:57:21,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:57:21,401 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 5 states. [2018-12-02 05:57:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:21,552 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-12-02 05:57:21,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:57:21,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 05:57:21,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:21,561 INFO L225 Difference]: With dead ends: 74 [2018-12-02 05:57:21,561 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 05:57:21,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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 05:57:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 05:57:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-12-02 05:57:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 05:57:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-12-02 05:57:21,588 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 17 [2018-12-02 05:57:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:21,589 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-12-02 05:57:21,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:57:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-12-02 05:57:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 05:57:21,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:21,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:57:21,590 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION]=== [2018-12-02 05:57:21,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:21,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1361157942, now seen corresponding path program 1 times [2018-12-02 05:57:21,590 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:57:21,590 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:57:21,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:21,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:21,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 05:57:21,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:57:21,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:57:21,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:57:21,700 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 05:57:21,700 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:57:21,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:57:21,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:57:21,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:57:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:57:21,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:57:21,703 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 6 states. [2018-12-02 05:57:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:21,881 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-12-02 05:57:21,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:57:21,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-02 05:57:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:21,883 INFO L225 Difference]: With dead ends: 70 [2018-12-02 05:57:21,883 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 05:57:21,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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 05:57:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 05:57:21,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2018-12-02 05:57:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 05:57:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-12-02 05:57:21,891 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2018-12-02 05:57:21,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:21,891 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-12-02 05:57:21,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:57:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-12-02 05:57:21,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 05:57:21,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:21,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:57:21,892 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION]=== [2018-12-02 05:57:21,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:21,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1389787092, now seen corresponding path program 1 times [2018-12-02 05:57:21,893 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:57:21,893 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:57:21,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:21,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:21,972 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 05:57:21,973 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:57:21,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:57:21,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:57:21,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:57:21,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:57:21,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:57:21,975 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 5 states. [2018-12-02 05:57:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:21,989 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-12-02 05:57:21,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:57:21,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 05:57:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:21,990 INFO L225 Difference]: With dead ends: 64 [2018-12-02 05:57:21,990 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 05:57:21,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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 05:57:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 05:57:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-02 05:57:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 05:57:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-12-02 05:57:21,996 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 17 [2018-12-02 05:57:21,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:21,996 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-12-02 05:57:21,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:57:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-12-02 05:57:21,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 05:57:21,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:21,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:57:21,998 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION]=== [2018-12-02 05:57:21,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:21,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1058628532, now seen corresponding path program 1 times [2018-12-02 05:57:21,998 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:57:21,999 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:57:22,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:22,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:22,051 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 05:57:22,051 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:57:22,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:57:22,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:57:22,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:57:22,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:57:22,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:57:22,053 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2018-12-02 05:57:22,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:22,071 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-02 05:57:22,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:57:22,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 05:57:22,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:22,073 INFO L225 Difference]: With dead ends: 64 [2018-12-02 05:57:22,073 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 05:57:22,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 05:57:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 05:57:22,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-02 05:57:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 05:57:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-12-02 05:57:22,077 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 22 [2018-12-02 05:57:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:22,078 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-12-02 05:57:22,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:57:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-12-02 05:57:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 05:57:22,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:22,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:57:22,079 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION]=== [2018-12-02 05:57:22,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:22,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1439387405, now seen corresponding path program 1 times [2018-12-02 05:57:22,079 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:57:22,079 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:57:22,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:22,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:22,136 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 05:57:22,136 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:57:22,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:57:22,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:57:22,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:57:22,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:57:22,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:57:22,138 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 3 states. [2018-12-02 05:57:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:22,194 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-02 05:57:22,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:57:22,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 05:57:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:22,195 INFO L225 Difference]: With dead ends: 68 [2018-12-02 05:57:22,195 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 05:57:22,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:57:22,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 05:57:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-02 05:57:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 05:57:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-02 05:57:22,199 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 22 [2018-12-02 05:57:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:22,200 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-02 05:57:22,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:57:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-02 05:57:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 05:57:22,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:22,201 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 05:57:22,201 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION]=== [2018-12-02 05:57:22,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:22,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1937675523, now seen corresponding path program 1 times [2018-12-02 05:57:22,202 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:57:22,202 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:57:22,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:22,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:22,289 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 05:57:22,289 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:57:22,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:57:22,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:57:22,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:57:22,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:57:22,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:57:22,292 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 4 states. [2018-12-02 05:57:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:22,320 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-12-02 05:57:22,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:57:22,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-02 05:57:22,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:22,321 INFO L225 Difference]: With dead ends: 61 [2018-12-02 05:57:22,321 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 05:57:22,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:57:22,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 05:57:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-02 05:57:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 05:57:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-12-02 05:57:22,324 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 32 [2018-12-02 05:57:22,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:22,324 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-12-02 05:57:22,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:57:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-12-02 05:57:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 05:57:22,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:57:22,325 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION]=== [2018-12-02 05:57:22,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:22,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1956552743, now seen corresponding path program 1 times [2018-12-02 05:57:22,325 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:57:22,325 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:57:22,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:22,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:22,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:22,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:22,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:22,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:22,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:22,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 05:57:22,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:57:22,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:57:22,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:57:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 05:57:22,640 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:57:22,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:57:22,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 5] total 18 [2018-12-02 05:57:22,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 05:57:22,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 05:57:22,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:57:22,666 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 18 states. [2018-12-02 05:57:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:23,443 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-12-02 05:57:23,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 05:57:23,444 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-12-02 05:57:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:23,444 INFO L225 Difference]: With dead ends: 65 [2018-12-02 05:57:23,445 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 05:57:23,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2018-12-02 05:57:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 05:57:23,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-02 05:57:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 05:57:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-02 05:57:23,447 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 33 [2018-12-02 05:57:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:23,448 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-02 05:57:23,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 05:57:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-02 05:57:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 05:57:23,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:23,448 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:23,449 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION]=== [2018-12-02 05:57:23,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1153066366, now seen corresponding path program 1 times [2018-12-02 05:57:23,449 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:57:23,449 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:57:23,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:23,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:23,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:23,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:23,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:23,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:23,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:23,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 05:57:23,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:57:23,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:57:23,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:57:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 05:57:24,061 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:57:24,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:57:24,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 8] total 25 [2018-12-02 05:57:24,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-02 05:57:24,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 05:57:24,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-12-02 05:57:24,077 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 25 states. [2018-12-02 05:57:26,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:26,108 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-12-02 05:57:26,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 05:57:26,109 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 36 [2018-12-02 05:57:26,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:26,109 INFO L225 Difference]: With dead ends: 70 [2018-12-02 05:57:26,109 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 05:57:26,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 05:57:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 05:57:26,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-02 05:57:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 05:57:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-02 05:57:26,114 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 36 [2018-12-02 05:57:26,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:26,114 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-02 05:57:26,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-02 05:57:26,114 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-02 05:57:26,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 05:57:26,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:26,115 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:26,115 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION]=== [2018-12-02 05:57:26,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:26,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1250977589, now seen corresponding path program 1 times [2018-12-02 05:57:26,116 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:57:26,116 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:57:26,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:26,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:26,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:57:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:57:26,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:57:26,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:57:26,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:26,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:26,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 05:57:26,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:57:26,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:57:26,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:57:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-02 05:57:27,145 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:57:27,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:57:27,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [14, 14] total 36 [2018-12-02 05:57:27,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-02 05:57:27,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-02 05:57:27,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 05:57:27,161 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 36 states. [2018-12-02 05:57:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:29,739 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-12-02 05:57:29,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-02 05:57:29,740 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2018-12-02 05:57:29,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:29,740 INFO L225 Difference]: With dead ends: 74 [2018-12-02 05:57:29,740 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 05:57:29,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=511, Invalid=2681, Unknown=0, NotChecked=0, Total=3192 [2018-12-02 05:57:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 05:57:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-02 05:57:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-02 05:57:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-12-02 05:57:29,744 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 47 [2018-12-02 05:57:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:29,744 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-12-02 05:57:29,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-02 05:57:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-12-02 05:57:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 05:57:29,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:29,745 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:29,745 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION]=== [2018-12-02 05:57:29,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:29,745 INFO L82 PathProgramCache]: Analyzing trace with hash 403513612, now seen corresponding path program 1 times [2018-12-02 05:57:29,745 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:57:29,745 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:57:29,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:29,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:29,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 05:57:29,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:57:29,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:57:29,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:57:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-02 05:57:30,101 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:57:30,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:57:30,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:57:30,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:57:30,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:57:30,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:57:30,104 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 13 states. [2018-12-02 05:57:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:30,523 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-02 05:57:30,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:57:30,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-12-02 05:57:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:30,524 INFO L225 Difference]: With dead ends: 68 [2018-12-02 05:57:30,525 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 05:57:30,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:57:30,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 05:57:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-02 05:57:30,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 05:57:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-02 05:57:30,528 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 53 [2018-12-02 05:57:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:30,529 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-02 05:57:30,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:57:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-02 05:57:30,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:57:30,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:30,530 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:30,530 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION]=== [2018-12-02 05:57:30,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:30,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2070676730, now seen corresponding path program 1 times [2018-12-02 05:57:30,530 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:57:30,530 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:57:30,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:30,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-02 05:57:30,633 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:57:30,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:57:30,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:57:30,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:57:30,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:57:30,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:57:30,636 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 7 states. [2018-12-02 05:57:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:30,666 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-12-02 05:57:30,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:57:30,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-02 05:57:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:30,667 INFO L225 Difference]: With dead ends: 70 [2018-12-02 05:57:30,667 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 05:57:30,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:57:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 05:57:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-02 05:57:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 05:57:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-12-02 05:57:30,671 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 51 [2018-12-02 05:57:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:30,671 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-12-02 05:57:30,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:57:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-12-02 05:57:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 05:57:30,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:30,673 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:30,673 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION]=== [2018-12-02 05:57:30,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:30,673 INFO L82 PathProgramCache]: Analyzing trace with hash -984290069, now seen corresponding path program 1 times [2018-12-02 05:57:30,674 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:57:30,674 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:57:30,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:57:30,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:57:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-02 05:57:30,781 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:57:30,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:57:30,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:57:30,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:57:30,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:57:30,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:57:30,783 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 9 states. [2018-12-02 05:57:30,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:57:30,839 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-02 05:57:30,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:57:30,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-12-02 05:57:30,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:57:30,840 INFO L225 Difference]: With dead ends: 72 [2018-12-02 05:57:30,840 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 05:57:30,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:57:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 05:57:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-02 05:57:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 05:57:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-02 05:57:30,842 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 56 [2018-12-02 05:57:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:57:30,842 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-02 05:57:30,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:57:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-02 05:57:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:57:30,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:57:30,843 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:30,843 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION]=== [2018-12-02 05:57:30,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:57:30,843 INFO L82 PathProgramCache]: Analyzing trace with hash -166624615, now seen corresponding path program 1 times [2018-12-02 05:57:30,843 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:57:30,843 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2404e2c7-a89d-4070-aa7d-adefc898efc2/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:57:30,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:57:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:57:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:57:37,327 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 05:57:37,339 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-12-02 05:57:37,342 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 05:57:37,349 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 05:57:37,349 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 05:57:37,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:57:37 BoogieIcfgContainer [2018-12-02 05:57:37,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:57:37,356 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:57:37,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:57:37,356 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:57:37,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:57:21" (3/4) ... [2018-12-02 05:57:37,359 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 05:57:37,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:57:37,360 INFO L168 Benchmark]: Toolchain (without parser) took 16796.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.1 MB). Free memory was 939.3 MB in the beginning and 870.6 MB in the end (delta: 68.8 MB). Peak memory consumption was 351.9 MB. Max. memory is 11.5 GB. [2018-12-02 05:57:37,361 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:57:37,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2018-12-02 05:57:37,361 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:57:37,361 INFO L168 Benchmark]: Boogie Preprocessor took 18.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:57:37,362 INFO L168 Benchmark]: RCFGBuilder took 236.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-12-02 05:57:37,362 INFO L168 Benchmark]: TraceAbstraction took 16164.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 870.6 MB in the end (delta: 197.8 MB). Peak memory consumption was 348.2 MB. Max. memory is 11.5 GB. [2018-12-02 05:57:37,363 INFO L168 Benchmark]: Witness Printer took 3.12 ms. Allocated memory is still 1.3 GB. Free memory is still 870.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:57:37,365 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16164.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 870.6 MB in the end (delta: 197.8 MB). Peak memory consumption was 348.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.12 ms. Allocated memory is still 1.3 GB. Free memory is still 870.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1441]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1441. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={-485990135:0}] [L1442] CALL entry_point() VAL [ldv_global_msg_list={-485990135:0}] [L1436] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={-485990135:0}] [L1437] CALL, EXPR ldv_kobject_create() VAL [ldv_global_msg_list={-485990135:0}] [L1406] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={-485990135:0}] [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16, ldv_global_msg_list={-485990135:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=16, \result={1:0}, ldv_global_msg_list={-485990135:0}, malloc(size)={1:0}, size=16] [L1408] RET, EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_global_msg_list={-485990135:0}, ldv_malloc(sizeof(*kobj))={1:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) VAL [kobj={1:0}, ldv_global_msg_list={-485990135:0}] [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) VAL [kobj={1:0}, ldv_global_msg_list={-485990135:0}, memset(kobj, 0, sizeof(*kobj))={1:0}] [L1413] CALL ldv_kobject_init(kobj) VAL [kobj={1:0}, ldv_global_msg_list={-485990135:0}] [L1394] COND FALSE !(!kobj) VAL [kobj={1:0}, kobj={1:0}, ldv_global_msg_list={-485990135:0}] [L1398] CALL ldv_kobject_init_internal(kobj) VAL [kobj={1:0}, ldv_global_msg_list={-485990135:0}] [L1380] COND FALSE !(!kobj) VAL [kobj={1:0}, kobj={1:0}, ldv_global_msg_list={-485990135:0}] [L1382] CALL ldv_kref_init(&kobj->kref) VAL [kref={1:12}, ldv_global_msg_list={-485990135:0}] [L1294] ((&kref->refcount)->counter) = (1) VAL [kref={1:12}, kref={1:12}, ldv_global_msg_list={-485990135:0}] [L1382] RET ldv_kref_init(&kobj->kref) VAL [kobj={1:0}, kobj={1:0}, ldv_global_msg_list={-485990135:0}] [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [ldv_global_msg_list={-485990135:0}, list={1:4}] [L1099] list->next = list VAL [ldv_global_msg_list={-485990135:0}, list={1:4}, list={1:4}] [L1100] list->prev = list VAL [ldv_global_msg_list={-485990135:0}, list={1:4}, list={1:4}] [L1383] RET LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={1:0}, kobj={1:0}, ldv_global_msg_list={-485990135:0}] [L1398] RET ldv_kobject_init_internal(kobj) VAL [kobj={1:0}, kobj={1:0}, ldv_global_msg_list={-485990135:0}] [L1413] RET ldv_kobject_init(kobj) VAL [kobj={1:0}, ldv_global_msg_list={-485990135:0}] [L1414] return kobj; VAL [\result={1:0}, kobj={1:0}, ldv_global_msg_list={-485990135:0}] [L1437] RET, EXPR ldv_kobject_create() VAL [ldv_global_msg_list={-485990135:0}, ldv_kobject_create()={1:0}] [L1437] kobj = ldv_kobject_create() [L1442] RET entry_point() VAL [ldv_global_msg_list={-485990135:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 63 locations, 9 error locations. UNSAFE Result, 16.1s OverallTime, 13 OverallIterations, 16 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 583 SDtfs, 304 SDslu, 2696 SDs, 0 SdLazy, 2382 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 675 GetRequests, 497 SyntacticMatches, 11 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 586 NumberOfCodeBlocks, 586 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 617 ConstructedInterpolants, 59 QuantifiedInterpolants, 70216 SizeOfPredicates, 42 NumberOfNonLiveVariables, 2242 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 474/606 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...