./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7_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_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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 769eb05e4e9ecf306aff3e68f9d0c3446a53669d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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 769eb05e4e9ecf306aff3e68f9d0c3446a53669d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 01:18:58,984 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:18:58,985 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:18:58,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:18:58,991 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:18:58,992 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:18:58,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:18:58,993 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:18:58,994 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:18:58,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:18:58,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:18:58,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:18:58,995 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:18:58,996 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:18:58,996 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:18:58,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:18:58,997 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:18:58,998 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:18:58,999 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:18:59,000 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:18:59,000 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:18:59,001 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:18:59,002 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:18:59,002 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:18:59,002 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:18:59,002 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:18:59,003 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:18:59,003 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:18:59,004 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:18:59,004 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:18:59,004 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:18:59,005 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:18:59,005 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:18:59,005 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:18:59,005 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:18:59,006 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:18:59,006 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 01:18:59,013 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:18:59,013 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:18:59,013 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:18:59,014 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:18:59,014 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 01:18:59,014 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 01:18:59,014 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 01:18:59,014 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 01:18:59,014 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 01:18:59,014 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 01:18:59,014 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 01:18:59,014 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 01:18:59,014 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 01:18:59,015 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:18:59,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:18:59,015 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:18:59,015 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:18:59,015 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:18:59,015 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:18:59,015 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:18:59,015 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:18:59,015 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 01:18:59,015 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 01:18:59,015 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 01:18:59,016 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:18:59,016 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:18:59,016 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:18:59,016 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:18:59,016 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:18:59,016 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:18:59,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:18:59,016 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:18:59,016 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:18:59,016 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 01:18:59,016 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:18:59,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:18:59,017 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_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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 -> 769eb05e4e9ecf306aff3e68f9d0c3446a53669d [2018-12-09 01:18:59,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:18:59,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:18:59,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:18:59,045 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:18:59,045 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:18:59,046 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i [2018-12-09 01:18:59,079 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/data/175600cbf/ddd75caa82db40638de498d5792ad4cd/FLAG65b7a9e5a [2018-12-09 01:18:59,577 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:18:59,577 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/sv-benchmarks/c/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i [2018-12-09 01:18:59,584 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/data/175600cbf/ddd75caa82db40638de498d5792ad4cd/FLAG65b7a9e5a [2018-12-09 01:18:59,593 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/data/175600cbf/ddd75caa82db40638de498d5792ad4cd [2018-12-09 01:18:59,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:18:59,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:18:59,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:18:59,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:18:59,598 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:18:59,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:18:59" (1/1) ... [2018-12-09 01:18:59,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5fc0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:18:59, skipping insertion in model container [2018-12-09 01:18:59,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:18:59" (1/1) ... [2018-12-09 01:18:59,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:18:59,628 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:18:59,848 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:18:59,857 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:18:59,892 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:18:59,923 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:18:59,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:18:59 WrapperNode [2018-12-09 01:18:59,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:18:59,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:18:59,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:18:59,924 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:18:59,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:18:59" (1/1) ... [2018-12-09 01:18:59,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:18:59" (1/1) ... [2018-12-09 01:18:59,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:18:59,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:18:59,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:18:59,945 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:18:59,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:18:59" (1/1) ... [2018-12-09 01:18:59,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:18:59" (1/1) ... [2018-12-09 01:18:59,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:18:59" (1/1) ... [2018-12-09 01:18:59,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:18:59" (1/1) ... [2018-12-09 01:18:59,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:18:59" (1/1) ... [2018-12-09 01:18:59,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:18:59" (1/1) ... [2018-12-09 01:18:59,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:18:59" (1/1) ... [2018-12-09 01:18:59,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:18:59,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:18:59,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:18:59,960 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:18:59,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:18:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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-09 01:18:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:18:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 01:18:59,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 01:18:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:18:59,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:18:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:18:59,994 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:18:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 01:18:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2018-12-09 01:18:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2018-12-09 01:18:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2018-12-09 01:18:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2018-12-09 01:18:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-12-09 01:18:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-12-09 01:18:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:18:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 01:18:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 01:18:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 01:18:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:18:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:18:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-12-09 01:18:59,996 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-12-09 01:19:00,151 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:19:00,151 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 01:19:00,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:19:00 BoogieIcfgContainer [2018-12-09 01:19:00,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:19:00,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:19:00,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:19:00,154 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:19:00,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:18:59" (1/3) ... [2018-12-09 01:19:00,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbce1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:19:00, skipping insertion in model container [2018-12-09 01:19:00,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:18:59" (2/3) ... [2018-12-09 01:19:00,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbce1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:19:00, skipping insertion in model container [2018-12-09 01:19:00,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:19:00" (3/3) ... [2018-12-09 01:19:00,156 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test7_false-valid-memtrack_true-termination.i [2018-12-09 01:19:00,161 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:19:00,165 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-12-09 01:19:00,176 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-12-09 01:19:00,196 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:19:00,196 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 01:19:00,196 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:19:00,196 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:19:00,196 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:19:00,196 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:19:00,196 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:19:00,196 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:19:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2018-12-09 01:19:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:19:00,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:00,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:00,214 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:19:00,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:00,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1593489789, now seen corresponding path program 1 times [2018-12-09 01:19:00,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:19:00,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:00,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:19:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:00,363 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-09 01:19:00,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:00,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:19:00,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:19:00,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:19:00,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:19:00,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:19:00,377 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 5 states. [2018-12-09 01:19:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:00,409 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-12-09 01:19:00,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:19:00,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-09 01:19:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:00,416 INFO L225 Difference]: With dead ends: 51 [2018-12-09 01:19:00,416 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 01:19:00,417 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-09 01:19:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 01:19:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-09 01:19:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 01:19:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-12-09 01:19:00,439 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 23 [2018-12-09 01:19:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:00,439 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-12-09 01:19:00,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:19:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-12-09 01:19:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 01:19:00,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:00,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:00,440 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:19:00,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:00,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2141424003, now seen corresponding path program 1 times [2018-12-09 01:19:00,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:19:00,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:00,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:19:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:00,488 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-09 01:19:00,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:00,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:19:00,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:19:00,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:19:00,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:19:00,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:19:00,489 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2018-12-09 01:19:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:00,532 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-12-09 01:19:00,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:19:00,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-12-09 01:19:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:00,534 INFO L225 Difference]: With dead ends: 66 [2018-12-09 01:19:00,535 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 01:19:00,535 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-09 01:19:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 01:19:00,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-12-09 01:19:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 01:19:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-12-09 01:19:00,542 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 24 [2018-12-09 01:19:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:00,543 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-12-09 01:19:00,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:19:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-12-09 01:19:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 01:19:00,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:00,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:00,545 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:19:00,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:00,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1860140286, now seen corresponding path program 1 times [2018-12-09 01:19:00,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:19:00,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:00,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:19:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:00,580 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-09 01:19:00,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:00,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:19:00,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:19:00,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:19:00,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:19:00,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:19:00,582 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 5 states. [2018-12-09 01:19:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:00,593 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-12-09 01:19:00,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:19:00,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-12-09 01:19:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:00,594 INFO L225 Difference]: With dead ends: 53 [2018-12-09 01:19:00,594 INFO L226 Difference]: Without dead ends: 53 [2018-12-09 01:19:00,594 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-09 01:19:00,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-09 01:19:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-12-09 01:19:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-09 01:19:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-12-09 01:19:00,597 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 24 [2018-12-09 01:19:00,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:00,597 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-12-09 01:19:00,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:19:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-12-09 01:19:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 01:19:00,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:00,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:00,598 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:19:00,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:00,598 INFO L82 PathProgramCache]: Analyzing trace with hash -135655094, now seen corresponding path program 1 times [2018-12-09 01:19:00,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:19:00,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:00,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:19:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:00,621 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-09 01:19:00,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:00,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:19:00,622 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:19:00,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:19:00,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:19:00,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:19:00,622 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2018-12-09 01:19:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:00,638 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-12-09 01:19:00,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:19:00,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-12-09 01:19:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:00,639 INFO L225 Difference]: With dead ends: 53 [2018-12-09 01:19:00,639 INFO L226 Difference]: Without dead ends: 53 [2018-12-09 01:19:00,639 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-09 01:19:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-09 01:19:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-12-09 01:19:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-09 01:19:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-12-09 01:19:00,642 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 24 [2018-12-09 01:19:00,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:00,642 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-12-09 01:19:00,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:19:00,642 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-12-09 01:19:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 01:19:00,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:00,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:00,643 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:19:00,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:00,643 INFO L82 PathProgramCache]: Analyzing trace with hash -429058101, now seen corresponding path program 1 times [2018-12-09 01:19:00,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:19:00,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:00,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:19:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:00,684 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-09 01:19:00,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:00,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:19:00,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:19:00,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:19:00,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:19:00,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:19:00,684 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 4 states. [2018-12-09 01:19:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:00,747 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-12-09 01:19:00,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:19:00,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-12-09 01:19:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:00,748 INFO L225 Difference]: With dead ends: 60 [2018-12-09 01:19:00,748 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 01:19:00,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:19:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 01:19:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-09 01:19:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 01:19:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-12-09 01:19:00,752 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 24 [2018-12-09 01:19:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:00,752 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-12-09 01:19:00,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:19:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-12-09 01:19:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 01:19:00,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:00,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:00,754 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:19:00,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:00,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1291172173, now seen corresponding path program 1 times [2018-12-09 01:19:00,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:19:00,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:00,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:19:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:00,807 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-09 01:19:00,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:00,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:19:00,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:19:00,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:19:00,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:19:00,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:19:00,808 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 7 states. [2018-12-09 01:19:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:00,917 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-12-09 01:19:00,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:19:00,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-12-09 01:19:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:00,918 INFO L225 Difference]: With dead ends: 52 [2018-12-09 01:19:00,918 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 01:19:00,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:19:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 01:19:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-12-09 01:19:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 01:19:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-12-09 01:19:00,921 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 29 [2018-12-09 01:19:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:00,922 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-12-09 01:19:00,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:19:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-12-09 01:19:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 01:19:00,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:00,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:00,923 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:19:00,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:00,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1291172172, now seen corresponding path program 1 times [2018-12-09 01:19:00,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:19:00,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:00,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:00,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:19:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:00,991 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-09 01:19:00,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:00,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:19:00,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:19:00,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:19:00,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:19:00,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:19:00,992 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 8 states. [2018-12-09 01:19:01,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:01,083 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-12-09 01:19:01,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:19:01,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-12-09 01:19:01,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:01,084 INFO L225 Difference]: With dead ends: 45 [2018-12-09 01:19:01,084 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 01:19:01,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:19:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 01:19:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 01:19:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 01:19:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-12-09 01:19:01,087 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 29 [2018-12-09 01:19:01,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:01,087 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-12-09 01:19:01,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:19:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-12-09 01:19:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 01:19:01,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:01,088 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-09 01:19:01,088 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:19:01,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash 319688976, now seen corresponding path program 1 times [2018-12-09 01:19:01,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:19:01,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:01,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:01,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:01,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:19:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:01,226 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-09 01:19:01,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:01,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:19:01,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:19:01,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:19:01,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:19:01,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:19:01,227 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 8 states. [2018-12-09 01:19:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:01,345 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-12-09 01:19:01,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:19:01,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-12-09 01:19:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:01,346 INFO L225 Difference]: With dead ends: 54 [2018-12-09 01:19:01,346 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 01:19:01,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:19:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 01:19:01,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 01:19:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 01:19:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-09 01:19:01,348 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-12-09 01:19:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:01,348 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-09 01:19:01,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:19:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-09 01:19:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 01:19:01,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:01,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:01,349 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:19:01,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1593417128, now seen corresponding path program 1 times [2018-12-09 01:19:01,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:19:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:01,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:01,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:19:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:01,369 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-09 01:19:01,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:01,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:19:01,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:19:01,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:19:01,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:19:01,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:19:01,370 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 5 states. [2018-12-09 01:19:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:01,373 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2018-12-09 01:19:01,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:19:01,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-09 01:19:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:01,374 INFO L225 Difference]: With dead ends: 43 [2018-12-09 01:19:01,374 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 01:19:01,374 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-09 01:19:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 01:19:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 01:19:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 01:19:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2018-12-09 01:19:01,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 38 [2018-12-09 01:19:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:01,376 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2018-12-09 01:19:01,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:19:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2018-12-09 01:19:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 01:19:01,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:01,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:01,377 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:19:01,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:01,378 INFO L82 PathProgramCache]: Analyzing trace with hash -75356203, now seen corresponding path program 1 times [2018-12-09 01:19:01,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:19:01,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:01,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:01,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:19:01,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:19:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:19:01,407 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 01:19:01,415 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 01:19:01,422 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 01:19:01,422 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 01:19:01,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:19:01 BoogieIcfgContainer [2018-12-09 01:19:01,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:19:01,429 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:19:01,429 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:19:01,429 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:19:01,429 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:19:00" (3/4) ... [2018-12-09 01:19:01,432 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 01:19:01,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:19:01,432 INFO L168 Benchmark]: Toolchain (without parser) took 1837.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 948.1 MB in the beginning and 849.4 MB in the end (delta: 98.6 MB). Peak memory consumption was 239.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:01,433 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:19:01,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:01,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.65 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-09 01:19:01,434 INFO L168 Benchmark]: Boogie Preprocessor took 14.89 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-09 01:19:01,434 INFO L168 Benchmark]: RCFGBuilder took 191.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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:01,435 INFO L168 Benchmark]: TraceAbstraction took 1276.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 849.4 MB in the end (delta: 235.4 MB). Peak memory consumption was 235.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:19:01,435 INFO L168 Benchmark]: Witness Printer took 3.10 ms. Allocated memory is still 1.2 GB. Free memory is still 849.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:19:01,437 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.65 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 14.89 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 191.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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1276.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 849.4 MB in the end (delta: 235.4 MB). Peak memory consumption was 235.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.10 ms. Allocated memory is still 1.2 GB. Free memory is still 849.4 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 ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10 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 9 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: 1473]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1473. 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={13:0}] [L1474] CALL entry_point() VAL [ldv_global_msg_list={13:0}] [L1466] struct A a7; VAL [a7={14:0}, ldv_global_msg_list={13:0}] [L1467] CALL, EXPR probe1_6(&a7) VAL [a={14:0}, ldv_global_msg_list={13:0}] [L1443] int ret = - -3; VAL [a={14:0}, a={14:0}, ldv_global_msg_list={13:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={13:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={12:0}, ldv_global_msg_list={13:0}, malloc(size)={12:0}, size=4] [L1444] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={14:0}, a={14:0}, ldv_global_msg_list={13:0}, ldv_malloc(sizeof(int))={12:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND FALSE !(p==0) VAL [a={14:0}, a={14:0}, ldv_global_msg_list={13:0}, p={12:0}, ret=3] [L1447] CALL, EXPR f6() VAL [ldv_global_msg_list={13:0}] [L1435] return __VERIFIER_nondet_int(); [L1447] RET, EXPR f6() VAL [a={14:0}, a={14:0}, f6()=0, ldv_global_msg_list={13:0}, p={12:0}, ret=3] [L1447] ret = f6() [L1448] COND FALSE !(ret<0) VAL [a={14:0}, a={14:0}, ldv_global_msg_list={13:0}, p={12:0}, ret=0] [L1450] CALL, EXPR g6() VAL [ldv_global_msg_list={13:0}] [L1439] return __VERIFIER_nondet_int(); [L1450] RET, EXPR g6() VAL [a={14:0}, a={14:0}, g6()=0, ldv_global_msg_list={13:0}, p={12:0}, ret=0] [L1450] ret = g6() [L1451] COND FALSE !(ret<0) VAL [a={14:0}, a={14:0}, ldv_global_msg_list={13:0}, p={12:0}, ret=0] [L1453] a->p = p VAL [a={14:0}, a={14:0}, ldv_global_msg_list={13:0}, p={12:0}, ret=0] [L1454] return 0; VAL [\result=0, a={14:0}, a={14:0}, ldv_global_msg_list={13:0}, p={12:0}, ret=0] [L1467] RET, EXPR probe1_6(&a7) VAL [a7={14:0}, ldv_global_msg_list={13:0}, probe1_6(&a7)=0] [L1467] int ret = probe1_6(&a7); [L1468] COND TRUE ret==0 VAL [a7={14:0}, ldv_global_msg_list={13:0}, ret=0] [L1469] FCALL disconnect_2_6(&a7) VAL [a7={14:0}, ldv_global_msg_list={13:0}, ret=0] [L1474] RET entry_point() VAL [ldv_global_msg_list={13:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 52 locations, 5 error locations. UNSAFE Result, 1.2s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 407 SDtfs, 142 SDslu, 957 SDs, 0 SdLazy, 539 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, 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, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 25041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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-09 01:19:02,732 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:19:02,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:19:02,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:19:02,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:19:02,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:19:02,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:19:02,741 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:19:02,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:19:02,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:19:02,743 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:19:02,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:19:02,743 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:19:02,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:19:02,744 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:19:02,745 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:19:02,745 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:19:02,746 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:19:02,747 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:19:02,748 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:19:02,748 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:19:02,749 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:19:02,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:19:02,750 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:19:02,750 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:19:02,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:19:02,751 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:19:02,752 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:19:02,752 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:19:02,753 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:19:02,753 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:19:02,753 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:19:02,753 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:19:02,753 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:19:02,754 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:19:02,754 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:19:02,755 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 01:19:02,762 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:19:02,762 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:19:02,763 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:19:02,763 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:19:02,763 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 01:19:02,763 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 01:19:02,763 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 01:19:02,763 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 01:19:02,763 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 01:19:02,763 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 01:19:02,764 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:19:02,764 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:19:02,764 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:19:02,764 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:19:02,764 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:19:02,764 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:19:02,765 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:19:02,765 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:19:02,765 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 01:19:02,765 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 01:19:02,765 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 01:19:02,765 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:19:02,765 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 01:19:02,765 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 01:19:02,765 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:19:02,766 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:19:02,766 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:19:02,766 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:19:02,766 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:19:02,766 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:19:02,766 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:19:02,766 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:19:02,766 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:19:02,766 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 01:19:02,767 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:19:02,767 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 01:19:02,767 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_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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 -> 769eb05e4e9ecf306aff3e68f9d0c3446a53669d [2018-12-09 01:19:02,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:19:02,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:19:02,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:19:02,799 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:19:02,800 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:19:02,800 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i [2018-12-09 01:19:02,845 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/data/ad54e74dd/b213510f2d674532a21ddd0fe3c8f49e/FLAG33d9f6485 [2018-12-09 01:19:03,179 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:19:03,180 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/sv-benchmarks/c/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i [2018-12-09 01:19:03,188 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/data/ad54e74dd/b213510f2d674532a21ddd0fe3c8f49e/FLAG33d9f6485 [2018-12-09 01:19:03,196 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/data/ad54e74dd/b213510f2d674532a21ddd0fe3c8f49e [2018-12-09 01:19:03,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:19:03,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:19:03,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:19:03,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:19:03,202 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:19:03,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:19:03" (1/1) ... [2018-12-09 01:19:03,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d255691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:03, skipping insertion in model container [2018-12-09 01:19:03,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:19:03" (1/1) ... [2018-12-09 01:19:03,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:19:03,233 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:19:03,429 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:19:03,441 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:19:03,506 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:19:03,540 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:19:03,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:03 WrapperNode [2018-12-09 01:19:03,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:19:03,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:19:03,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:19:03,541 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:19:03,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:03" (1/1) ... [2018-12-09 01:19:03,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:03" (1/1) ... [2018-12-09 01:19:03,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:19:03,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:19:03,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:19:03,563 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:19:03,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:03" (1/1) ... [2018-12-09 01:19:03,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:03" (1/1) ... [2018-12-09 01:19:03,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:03" (1/1) ... [2018-12-09 01:19:03,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:03" (1/1) ... [2018-12-09 01:19:03,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:03" (1/1) ... [2018-12-09 01:19:03,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:03" (1/1) ... [2018-12-09 01:19:03,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:03" (1/1) ... [2018-12-09 01:19:03,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:19:03,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:19:03,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:19:03,580 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:19:03,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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-09 01:19:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:19:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 01:19:03,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 01:19:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:19:03,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:19:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:19:03,610 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:19:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 01:19:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2018-12-09 01:19:03,610 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2018-12-09 01:19:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2018-12-09 01:19:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2018-12-09 01:19:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-12-09 01:19:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-12-09 01:19:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:19:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 01:19:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 01:19:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 01:19:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:19:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:19:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-12-09 01:19:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-12-09 01:19:03,778 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:19:03,778 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 01:19:03,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:19:03 BoogieIcfgContainer [2018-12-09 01:19:03,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:19:03,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:19:03,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:19:03,782 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:19:03,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:19:03" (1/3) ... [2018-12-09 01:19:03,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7ede93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:19:03, skipping insertion in model container [2018-12-09 01:19:03,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:19:03" (2/3) ... [2018-12-09 01:19:03,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7ede93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:19:03, skipping insertion in model container [2018-12-09 01:19:03,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:19:03" (3/3) ... [2018-12-09 01:19:03,784 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test7_false-valid-memtrack_true-termination.i [2018-12-09 01:19:03,789 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:19:03,793 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-12-09 01:19:03,801 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-12-09 01:19:03,815 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:19:03,816 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:19:03,816 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 01:19:03,816 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:19:03,816 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:19:03,816 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:19:03,816 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:19:03,816 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:19:03,816 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:19:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2018-12-09 01:19:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 01:19:03,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:03,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:03,831 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:19:03,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:03,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1593489789, now seen corresponding path program 1 times [2018-12-09 01:19:03,837 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:19:03,837 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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-09 01:19:03,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:03,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:03,946 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-09 01:19:03,946 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:19:03,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:03,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:19:03,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:19:03,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:19:03,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:19:03,965 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 5 states. [2018-12-09 01:19:04,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:04,013 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-12-09 01:19:04,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:19:04,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-09 01:19:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:04,023 INFO L225 Difference]: With dead ends: 51 [2018-12-09 01:19:04,023 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 01:19:04,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-09 01:19:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 01:19:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-09 01:19:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 01:19:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-12-09 01:19:04,051 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 23 [2018-12-09 01:19:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:04,051 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-12-09 01:19:04,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:19:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-12-09 01:19:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 01:19:04,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:04,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:04,053 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:19:04,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:04,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2141424003, now seen corresponding path program 1 times [2018-12-09 01:19:04,053 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:19:04,054 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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-09 01:19:04,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:04,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:04,137 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-09 01:19:04,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:04,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:19:04,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:19:04,181 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-09 01:19:04,181 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:19:04,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:04,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:19:04,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:19:04,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:19:04,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:19:04,184 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2018-12-09 01:19:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:04,335 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-12-09 01:19:04,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:19:04,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-09 01:19:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:04,337 INFO L225 Difference]: With dead ends: 75 [2018-12-09 01:19:04,338 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 01:19:04,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:19:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 01:19:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2018-12-09 01:19:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 01:19:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-12-09 01:19:04,345 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 24 [2018-12-09 01:19:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:04,346 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-12-09 01:19:04,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:19:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-12-09 01:19:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 01:19:04,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:04,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:04,348 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:19:04,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1860140286, now seen corresponding path program 1 times [2018-12-09 01:19:04,348 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:19:04,348 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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-09 01:19:04,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:04,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:04,407 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-09 01:19:04,408 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:19:04,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:04,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:19:04,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:19:04,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:19:04,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:19:04,409 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 6 states. [2018-12-09 01:19:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:04,452 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-12-09 01:19:04,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:19:04,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-09 01:19:04,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:04,455 INFO L225 Difference]: With dead ends: 66 [2018-12-09 01:19:04,455 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 01:19:04,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-09 01:19:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 01:19:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-12-09 01:19:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 01:19:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-12-09 01:19:04,459 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 24 [2018-12-09 01:19:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:04,459 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-12-09 01:19:04,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:19:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-12-09 01:19:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 01:19:04,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:04,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:04,460 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:19:04,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:04,461 INFO L82 PathProgramCache]: Analyzing trace with hash -135655094, now seen corresponding path program 1 times [2018-12-09 01:19:04,461 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:19:04,461 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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-09 01:19:04,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:04,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:04,523 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-09 01:19:04,523 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:19:04,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:04,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:19:04,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:19:04,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:19:04,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:19:04,525 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 5 states. [2018-12-09 01:19:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:04,550 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-12-09 01:19:04,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:19:04,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-12-09 01:19:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:04,552 INFO L225 Difference]: With dead ends: 63 [2018-12-09 01:19:04,552 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 01:19:04,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-09 01:19:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 01:19:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-12-09 01:19:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 01:19:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-12-09 01:19:04,556 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 24 [2018-12-09 01:19:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:04,556 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-12-09 01:19:04,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:19:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-12-09 01:19:04,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 01:19:04,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:04,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:04,557 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:19:04,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:04,557 INFO L82 PathProgramCache]: Analyzing trace with hash -429058101, now seen corresponding path program 1 times [2018-12-09 01:19:04,558 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:19:04,558 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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-09 01:19:04,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:04,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:04,645 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2018-12-09 01:19:04,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:04,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2018-12-09 01:19:04,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:04,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:19:04,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-09 01:19:04,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:04,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 15 [2018-12-09 01:19:04,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 01:19:04,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:19:04,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:19:04,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-09 01:19:05,329 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_entry_point_~#a7~0.base_8| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_~#a7~0.base_8|)) (= |c_#valid| (store |c_old(#valid)| |v_entry_point_~#a7~0.base_8| (_ bv0 1))))) is different from true [2018-12-09 01:19:05,353 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-09 01:19:05,353 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:19:05,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:05,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:19:05,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:19:05,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:19:05,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=26, Unknown=1, NotChecked=10, Total=56 [2018-12-09 01:19:05,356 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 8 states. [2018-12-09 01:19:28,434 WARN L180 SmtUtils]: Spent 968.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-09 01:19:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:40,566 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-12-09 01:19:40,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:19:40,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-09 01:19:40,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:40,567 INFO L225 Difference]: With dead ends: 79 [2018-12-09 01:19:40,567 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 01:19:40,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=23, Invalid=36, Unknown=1, NotChecked=12, Total=72 [2018-12-09 01:19:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 01:19:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-12-09 01:19:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 01:19:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-12-09 01:19:40,571 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 24 [2018-12-09 01:19:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:40,571 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-12-09 01:19:40,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:19:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-12-09 01:19:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 01:19:40,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:40,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:40,572 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:19:40,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:40,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1291172173, now seen corresponding path program 1 times [2018-12-09 01:19:40,572 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:19:40,573 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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-09 01:19:40,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:40,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:40,638 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-09 01:19:40,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:40,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:19:40,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:19:41,120 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 01:19:41,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:41,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:41,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 01:19:41,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:41,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:19:41,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-09 01:19:41,240 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-09 01:19:41,241 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:19:41,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:41,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:19:41,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:19:41,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:19:41,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2018-12-09 01:19:41,244 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 9 states. [2018-12-09 01:19:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:41,451 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-09 01:19:41,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:19:41,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-12-09 01:19:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:41,452 INFO L225 Difference]: With dead ends: 73 [2018-12-09 01:19:41,452 INFO L226 Difference]: Without dead ends: 73 [2018-12-09 01:19:41,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=82, Unknown=1, NotChecked=18, Total=132 [2018-12-09 01:19:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-09 01:19:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2018-12-09 01:19:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 01:19:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-12-09 01:19:41,457 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 29 [2018-12-09 01:19:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:41,458 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-12-09 01:19:41,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:19:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-12-09 01:19:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 01:19:41,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:41,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:19:41,459 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:19:41,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:41,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1291172172, now seen corresponding path program 1 times [2018-12-09 01:19:41,460 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:19:41,460 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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-09 01:19:41,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:41,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:41,531 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-09 01:19:41,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:41,539 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-09 01:19:41,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:41,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:19:41,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:19:42,334 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-09 01:19:42,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:42,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:42,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:19:42,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:42,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 01:19:42,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:42,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:19:42,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-12-09 01:19:42,421 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-09 01:19:42,421 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:19:42,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:42,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:19:42,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:19:42,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:19:42,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=39, Unknown=1, NotChecked=12, Total=72 [2018-12-09 01:19:42,424 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 9 states. [2018-12-09 01:19:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:19:42,613 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-12-09 01:19:42,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:19:42,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-12-09 01:19:42,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:19:42,613 INFO L225 Difference]: With dead ends: 64 [2018-12-09 01:19:42,613 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 01:19:42,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=74, Unknown=1, NotChecked=18, Total=132 [2018-12-09 01:19:42,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 01:19:42,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-12-09 01:19:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 01:19:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-12-09 01:19:42,615 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 29 [2018-12-09 01:19:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:19:42,616 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-12-09 01:19:42,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:19:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-12-09 01:19:42,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 01:19:42,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:19:42,616 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-09 01:19:42,616 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:19:42,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:19:42,616 INFO L82 PathProgramCache]: Analyzing trace with hash 319688976, now seen corresponding path program 1 times [2018-12-09 01:19:42,617 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:19:42,617 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:19:42,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:19:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:19:42,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:19:42,693 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2018-12-09 01:19:42,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:42,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2018-12-09 01:19:42,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:42,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:19:42,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-09 01:19:42,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:42,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 15 [2018-12-09 01:19:42,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 01:19:42,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:19:42,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:19:42,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-09 01:19:42,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:19:42,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-12-09 01:19:42,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:19:42,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:19:42,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-12-09 01:19:43,950 WARN L854 $PredicateComparison]: unable to prove that (exists ((probe1_6_~p~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| probe1_6_~p~0.base)) (= |c_#valid| (store |c_old(#valid)| probe1_6_~p~0.base (_ bv0 1))))) is different from true [2018-12-09 01:19:46,973 WARN L180 SmtUtils]: Spent 998.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-09 01:19:48,079 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_entry_point_~#a7~0.base_9| (_ BitVec 32)) (probe1_6_~p~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a7~0.base_9| (_ bv1 1)))) (and (= (select .cse0 probe1_6_~p~0.base) (_ bv0 1)) (= (store (store .cse0 probe1_6_~p~0.base (_ bv0 1)) |v_entry_point_~#a7~0.base_9| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_~#a7~0.base_9|))))) is different from true [2018-12-09 01:19:48,116 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-09 01:19:48,116 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:19:48,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:19:48,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 01:19:48,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 01:19:48,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 01:19:48,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=81, Unknown=3, NotChecked=38, Total=156 [2018-12-09 01:19:48,119 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 13 states. [2018-12-09 01:20:01,779 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-09 01:20:09,760 WARN L180 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-12-09 01:20:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:20:12,998 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-09 01:20:12,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:20:12,998 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-12-09 01:20:12,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:20:12,999 INFO L225 Difference]: With dead ends: 57 [2018-12-09 01:20:12,999 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 01:20:12,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=43, Invalid=117, Unknown=4, NotChecked=46, Total=210 [2018-12-09 01:20:12,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 01:20:13,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 01:20:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 01:20:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-09 01:20:13,001 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-12-09 01:20:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:20:13,001 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-09 01:20:13,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 01:20:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-09 01:20:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 01:20:13,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:13,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:13,002 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:20:13,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:13,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1593417128, now seen corresponding path program 1 times [2018-12-09 01:20:13,002 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:20:13,002 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/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-09 01:20:13,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:13,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:20:13,050 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-09 01:20:13,050 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:20:13,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:20:13,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:20:13,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:20:13,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:20:13,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:20:13,052 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 5 states. [2018-12-09 01:20:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:20:13,056 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2018-12-09 01:20:13,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:20:13,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-09 01:20:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:20:13,057 INFO L225 Difference]: With dead ends: 43 [2018-12-09 01:20:13,057 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 01:20:13,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-09 01:20:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 01:20:13,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 01:20:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 01:20:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2018-12-09 01:20:13,059 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 38 [2018-12-09 01:20:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:20:13,059 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2018-12-09 01:20:13,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:20:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2018-12-09 01:20:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 01:20:13,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:13,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:13,060 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION]=== [2018-12-09 01:20:13,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:13,060 INFO L82 PathProgramCache]: Analyzing trace with hash -75356203, now seen corresponding path program 1 times [2018-12-09 01:20:13,060 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:20:13,060 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91f6ebeb-1ea6-4cbc-9e75-5f1fd202af3c/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:20:13,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:20:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:20:13,227 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 01:20:13,236 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 01:20:13,242 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-09 01:20:13,242 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-09 01:20:13,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:20:13 BoogieIcfgContainer [2018-12-09 01:20:13,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:20:13,249 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:20:13,249 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:20:13,249 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:20:13,249 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:19:03" (3/4) ... [2018-12-09 01:20:13,252 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 01:20:13,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:20:13,252 INFO L168 Benchmark]: Toolchain (without parser) took 70053.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -123.0 MB). Peak memory consumption was 82.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:20:13,253 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-09 01:20:13,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:20:13,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.21 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-09 01:20:13,253 INFO L168 Benchmark]: Boogie Preprocessor took 16.81 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-09 01:20:13,253 INFO L168 Benchmark]: RCFGBuilder took 199.46 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:20:13,254 INFO L168 Benchmark]: TraceAbstraction took 69469.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 87.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:20:13,254 INFO L168 Benchmark]: Witness Printer took 2.82 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-09 01:20:13,255 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 341.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.21 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 16.81 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 199.46 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69469.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 87.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.82 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. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - 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: 1473]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1473. 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={-2078209982:0}] [L1474] CALL entry_point() VAL [ldv_global_msg_list={-2078209982:0}] [L1466] struct A a7; VAL [a7={-1524020654:0}, ldv_global_msg_list={-2078209982:0}] [L1467] CALL, EXPR probe1_6(&a7) VAL [a={-1524020654:0}, ldv_global_msg_list={-2078209982:0}] [L1443] int ret = - -3; VAL [a={-1524020654:0}, a={-1524020654:0}, ldv_global_msg_list={-2078209982:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={-2078209982:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={-450278830:0}, ldv_global_msg_list={-2078209982:0}, malloc(size)={-450278830:0}, size=4] [L1444] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={-1524020654:0}, a={-1524020654:0}, ldv_global_msg_list={-2078209982:0}, ldv_malloc(sizeof(int))={-450278830:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND FALSE !(p==0) VAL [a={-1524020654:0}, a={-1524020654:0}, ldv_global_msg_list={-2078209982:0}, p={-450278830:0}, ret=3] [L1447] CALL, EXPR f6() VAL [ldv_global_msg_list={-2078209982:0}] [L1435] return __VERIFIER_nondet_int(); [L1447] RET, EXPR f6() VAL [a={-1524020654:0}, a={-1524020654:0}, f6()=0, ldv_global_msg_list={-2078209982:0}, p={-450278830:0}, ret=3] [L1447] ret = f6() [L1448] COND FALSE !(ret<0) VAL [a={-1524020654:0}, a={-1524020654:0}, ldv_global_msg_list={-2078209982:0}, p={-450278830:0}, ret=0] [L1450] CALL, EXPR g6() VAL [ldv_global_msg_list={-2078209982:0}] [L1439] return __VERIFIER_nondet_int(); [L1450] RET, EXPR g6() VAL [a={-1524020654:0}, a={-1524020654:0}, g6()=0, ldv_global_msg_list={-2078209982:0}, p={-450278830:0}, ret=0] [L1450] ret = g6() [L1451] COND FALSE !(ret<0) VAL [a={-1524020654:0}, a={-1524020654:0}, ldv_global_msg_list={-2078209982:0}, p={-450278830:0}, ret=0] [L1453] a->p = p VAL [a={-1524020654:0}, a={-1524020654:0}, ldv_global_msg_list={-2078209982:0}, p={-450278830:0}, ret=0] [L1454] return 0; VAL [\result=0, a={-1524020654:0}, a={-1524020654:0}, ldv_global_msg_list={-2078209982:0}, p={-450278830:0}, ret=0] [L1467] RET, EXPR probe1_6(&a7) VAL [a7={-1524020654:0}, ldv_global_msg_list={-2078209982:0}, probe1_6(&a7)=0] [L1467] int ret = probe1_6(&a7); [L1468] COND TRUE ret==0 VAL [a7={-1524020654:0}, ldv_global_msg_list={-2078209982:0}, ret=0] [L1469] FCALL disconnect_2_6(&a7) VAL [a7={-1524020654:0}, ldv_global_msg_list={-2078209982:0}, ret=0] [L1474] RET entry_point() VAL [ldv_global_msg_list={-2078209982:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 52 locations, 5 error locations. UNSAFE Result, 69.4s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 60.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 437 SDtfs, 354 SDslu, 1113 SDs, 0 SdLazy, 678 SolverSat, 112 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 50.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 181 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 17.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=6, 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, 9 MinimizatonAttempts, 52 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 238 ConstructedInterpolants, 50 QuantifiedInterpolants, 37158 SizeOfPredicates, 17 NumberOfNonLiveVariables, 937 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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...