./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_1_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_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 feda0632364bc935bd065aa8fb45d18a1f6a230c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 feda0632364bc935bd065aa8fb45d18a1f6a230c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:13:20,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:13:20,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:13:20,688 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:13:20,689 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:13:20,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:13:20,690 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:13:20,691 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:13:20,692 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:13:20,692 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:13:20,693 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:13:20,693 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:13:20,694 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:13:20,694 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:13:20,695 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:13:20,696 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:13:20,696 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:13:20,697 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:13:20,698 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:13:20,699 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:13:20,700 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:13:20,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:13:20,702 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:13:20,702 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:13:20,702 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:13:20,702 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:13:20,703 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:13:20,703 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:13:20,704 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:13:20,704 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:13:20,704 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:13:20,705 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:13:20,705 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:13:20,705 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:13:20,705 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:13:20,706 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:13:20,706 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 11:13:20,713 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:13:20,714 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:13:20,714 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:13:20,714 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:13:20,714 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 11:13:20,714 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 11:13:20,714 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 11:13:20,714 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 11:13:20,715 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 11:13:20,715 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 11:13:20,715 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 11:13:20,715 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 11:13:20,715 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 11:13:20,715 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 11:13:20,716 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 11:13:20,716 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:13:20,716 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:13:20,716 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 11:13:20,716 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:13:20,716 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:13:20,716 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:13:20,716 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 11:13:20,716 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 11:13:20,717 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 11:13:20,717 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:13:20,717 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:13:20,717 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:13:20,717 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:13:20,717 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:13:20,717 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:13:20,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:13:20,717 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:13:20,717 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:13:20,717 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 11:13:20,718 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:13:20,718 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 11:13:20,718 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_1e726467-b32f-4c36-9630-d7017f9dde60/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 -> feda0632364bc935bd065aa8fb45d18a1f6a230c [2018-12-09 11:13:20,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:13:20,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:13:20,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:13:20,751 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:13:20,752 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:13:20,752 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-12-09 11:13:20,796 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/data/c625f60d2/6fd22eaecd404b17aa3679f17dcebc2c/FLAG891870673 [2018-12-09 11:13:21,164 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:13:21,164 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/sv-benchmarks/c/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-12-09 11:13:21,171 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/data/c625f60d2/6fd22eaecd404b17aa3679f17dcebc2c/FLAG891870673 [2018-12-09 11:13:21,180 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/data/c625f60d2/6fd22eaecd404b17aa3679f17dcebc2c [2018-12-09 11:13:21,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:13:21,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:13:21,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:13:21,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:13:21,185 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:13:21,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:13:21" (1/1) ... [2018-12-09 11:13:21,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142c46d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:21, skipping insertion in model container [2018-12-09 11:13:21,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:13:21" (1/1) ... [2018-12-09 11:13:21,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:13:21,212 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:13:21,425 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:13:21,433 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:13:21,470 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:13:21,505 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:13:21,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:21 WrapperNode [2018-12-09 11:13:21,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:13:21,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:13:21,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:13:21,506 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:13:21,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:21" (1/1) ... [2018-12-09 11:13:21,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:21" (1/1) ... [2018-12-09 11:13:21,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:13:21,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:13:21,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:13:21,530 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:13:21,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:21" (1/1) ... [2018-12-09 11:13:21,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:21" (1/1) ... [2018-12-09 11:13:21,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:21" (1/1) ... [2018-12-09 11:13:21,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:21" (1/1) ... [2018-12-09 11:13:21,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:21" (1/1) ... [2018-12-09 11:13:21,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:21" (1/1) ... [2018-12-09 11:13:21,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:21" (1/1) ... [2018-12-09 11:13:21,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:13:21,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:13:21,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:13:21,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:13:21,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 11:13:21,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:13:21,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 11:13:21,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 11:13:21,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 11:13:21,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 11:13:21,580 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 11:13:21,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 11:13:21,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 11:13:21,580 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2018-12-09 11:13:21,580 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2018-12-09 11:13:21,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 11:13:21,580 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2018-12-09 11:13:21,580 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2018-12-09 11:13:21,580 INFO L130 BoogieDeclarations]: Found specification of procedure probe2_6 [2018-12-09 11:13:21,580 INFO L138 BoogieDeclarations]: Found implementation of procedure probe2_6 [2018-12-09 11:13:21,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 11:13:21,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 11:13:21,581 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 11:13:21,581 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 11:13:21,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:13:21,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:13:21,581 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-12-09 11:13:21,581 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-12-09 11:13:21,752 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:13:21,752 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 11:13:21,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:13:21 BoogieIcfgContainer [2018-12-09 11:13:21,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:13:21,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:13:21,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:13:21,756 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:13:21,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:13:21" (1/3) ... [2018-12-09 11:13:21,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2fac47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:13:21, skipping insertion in model container [2018-12-09 11:13:21,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:21" (2/3) ... [2018-12-09 11:13:21,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2fac47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:13:21, skipping insertion in model container [2018-12-09 11:13:21,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:13:21" (3/3) ... [2018-12-09 11:13:21,758 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-12-09 11:13:21,764 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:13:21,769 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-12-09 11:13:21,778 INFO L257 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2018-12-09 11:13:21,794 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:13:21,794 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 11:13:21,794 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:13:21,794 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:13:21,794 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:13:21,794 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:13:21,794 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:13:21,794 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:13:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-12-09 11:13:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 11:13:21,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:21,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:21,812 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 11:13:21,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1945648776, now seen corresponding path program 1 times [2018-12-09 11:13:21,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:13:21,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:21,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:21,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:21,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:13:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:21,958 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 11:13:21,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:21,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:13:21,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:13:21,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:13:21,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:13:21,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:13:21,976 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 5 states. [2018-12-09 11:13:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:22,020 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-12-09 11:13:22,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:13:22,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 11:13:22,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:22,030 INFO L225 Difference]: With dead ends: 79 [2018-12-09 11:13:22,030 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 11:13:22,031 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 11:13:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 11:13:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2018-12-09 11:13:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 11:13:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-12-09 11:13:22,056 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 20 [2018-12-09 11:13:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:22,057 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-12-09 11:13:22,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:13:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-12-09 11:13:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 11:13:22,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:22,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:22,058 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 11:13:22,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:22,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2142162281, now seen corresponding path program 1 times [2018-12-09 11:13:22,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:13:22,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:22,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:13:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:22,105 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 11:13:22,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:22,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:22,105 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:13:22,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:13:22,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:13:22,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:13:22,107 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 4 states. [2018-12-09 11:13:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:22,187 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-12-09 11:13:22,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:13:22,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 11:13:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:22,189 INFO L225 Difference]: With dead ends: 100 [2018-12-09 11:13:22,189 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 11:13:22,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:13:22,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 11:13:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2018-12-09 11:13:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 11:13:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2018-12-09 11:13:22,194 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 20 [2018-12-09 11:13:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:22,195 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2018-12-09 11:13:22,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:13:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2018-12-09 11:13:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 11:13:22,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:22,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:22,196 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 11:13:22,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:22,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2142162280, now seen corresponding path program 1 times [2018-12-09 11:13:22,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:13:22,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:22,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:13:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:22,234 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 11:13:22,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:22,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:22,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:13:22,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:13:22,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:13:22,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:13:22,235 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand 4 states. [2018-12-09 11:13:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:22,298 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-12-09 11:13:22,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:13:22,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 11:13:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:22,299 INFO L225 Difference]: With dead ends: 112 [2018-12-09 11:13:22,299 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 11:13:22,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:13:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 11:13:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2018-12-09 11:13:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 11:13:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-12-09 11:13:22,305 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 20 [2018-12-09 11:13:22,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:22,305 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-12-09 11:13:22,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:13:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-12-09 11:13:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 11:13:22,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:22,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:22,306 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 11:13:22,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:22,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1181178621, now seen corresponding path program 1 times [2018-12-09 11:13:22,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:13:22,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:22,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:13:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:22,341 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 11:13:22,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:22,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:13:22,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:13:22,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:13:22,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:13:22,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:13:22,342 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 5 states. [2018-12-09 11:13:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:22,353 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2018-12-09 11:13:22,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:13:22,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-09 11:13:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:22,354 INFO L225 Difference]: With dead ends: 97 [2018-12-09 11:13:22,354 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 11:13:22,354 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 11:13:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 11:13:22,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-09 11:13:22,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 11:13:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2018-12-09 11:13:22,359 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 22 [2018-12-09 11:13:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:22,359 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2018-12-09 11:13:22,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:13:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2018-12-09 11:13:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 11:13:22,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:22,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:22,360 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 11:13:22,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:22,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1328667612, now seen corresponding path program 1 times [2018-12-09 11:13:22,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:13:22,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:22,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:13:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:22,391 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 11:13:22,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:22,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:13:22,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:13:22,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:13:22,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:13:22,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:13:22,393 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand 6 states. [2018-12-09 11:13:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:22,528 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2018-12-09 11:13:22,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:13:22,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-09 11:13:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:22,529 INFO L225 Difference]: With dead ends: 114 [2018-12-09 11:13:22,530 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 11:13:22,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:13:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 11:13:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2018-12-09 11:13:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 11:13:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2018-12-09 11:13:22,538 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 22 [2018-12-09 11:13:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:22,538 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2018-12-09 11:13:22,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:13:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2018-12-09 11:13:22,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 11:13:22,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:22,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:22,540 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 11:13:22,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:22,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1328667611, now seen corresponding path program 1 times [2018-12-09 11:13:22,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:13:22,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:22,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:13:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:22,573 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 11:13:22,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:22,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:13:22,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:13:22,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:13:22,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:13:22,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:13:22,575 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand 6 states. [2018-12-09 11:13:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:22,595 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2018-12-09 11:13:22,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:13:22,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-09 11:13:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:22,597 INFO L225 Difference]: With dead ends: 107 [2018-12-09 11:13:22,597 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 11:13:22,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:13:22,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 11:13:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-09 11:13:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 11:13:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-12-09 11:13:22,603 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 22 [2018-12-09 11:13:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:22,604 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-12-09 11:13:22,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:13:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-12-09 11:13:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 11:13:22,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:22,605 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 11:13:22,605 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 11:13:22,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:22,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2038168316, now seen corresponding path program 1 times [2018-12-09 11:13:22,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:13:22,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:22,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:13:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:22,632 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 11:13:22,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:22,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:13:22,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:13:22,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:13:22,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:13:22,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:13:22,633 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 5 states. [2018-12-09 11:13:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:22,676 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2018-12-09 11:13:22,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:13:22,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-09 11:13:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:22,677 INFO L225 Difference]: With dead ends: 105 [2018-12-09 11:13:22,677 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 11:13:22,677 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 11:13:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 11:13:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-12-09 11:13:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 11:13:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2018-12-09 11:13:22,681 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 23 [2018-12-09 11:13:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:22,681 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-12-09 11:13:22,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:13:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-12-09 11:13:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 11:13:22,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:22,682 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 11:13:22,682 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 11:13:22,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1963395973, now seen corresponding path program 1 times [2018-12-09 11:13:22,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:13:22,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:22,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:13:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:22,712 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 11:13:22,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:22,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:13:22,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:13:22,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:13:22,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:13:22,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:13:22,714 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand 5 states. [2018-12-09 11:13:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:22,723 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-12-09 11:13:22,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:13:22,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-09 11:13:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:22,724 INFO L225 Difference]: With dead ends: 67 [2018-12-09 11:13:22,725 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 11:13:22,725 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 11:13:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 11:13:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-09 11:13:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 11:13:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-12-09 11:13:22,728 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 23 [2018-12-09 11:13:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:22,728 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-12-09 11:13:22,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:13:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-12-09 11:13:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:13:22,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:22,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:22,730 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 11:13:22,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:22,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1747249740, now seen corresponding path program 1 times [2018-12-09 11:13:22,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:13:22,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:22,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:13:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:22,800 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 11:13:22,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:22,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:13:22,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:13:22,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:13:22,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:13:22,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:13:22,801 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 7 states. [2018-12-09 11:13:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:22,942 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-12-09 11:13:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:13:22,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-09 11:13:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:22,943 INFO L225 Difference]: With dead ends: 72 [2018-12-09 11:13:22,943 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 11:13:22,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:13:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 11:13:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-12-09 11:13:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 11:13:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-12-09 11:13:22,946 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 28 [2018-12-09 11:13:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:22,946 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-12-09 11:13:22,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:13:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-12-09 11:13:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:13:22,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:22,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:22,947 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 11:13:22,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:22,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1747249739, now seen corresponding path program 1 times [2018-12-09 11:13:22,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:13:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:22,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:13:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:23,005 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 11:13:23,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:23,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:13:23,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:13:23,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:13:23,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:13:23,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:13:23,006 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 8 states. [2018-12-09 11:13:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:23,133 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-12-09 11:13:23,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 11:13:23,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-09 11:13:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:23,134 INFO L225 Difference]: With dead ends: 60 [2018-12-09 11:13:23,134 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 11:13:23,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-09 11:13:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 11:13:23,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-09 11:13:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 11:13:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-12-09 11:13:23,137 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 28 [2018-12-09 11:13:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:23,137 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-12-09 11:13:23,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:13:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-12-09 11:13:23,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:13:23,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:23,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:23,138 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 11:13:23,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:23,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2136961550, now seen corresponding path program 1 times [2018-12-09 11:13:23,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:13:23,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:23,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:23,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:23,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:13:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:23,255 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 11:13:23,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:23,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:13:23,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:13:23,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:13:23,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:13:23,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:13:23,256 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 7 states. [2018-12-09 11:13:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:23,404 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-12-09 11:13:23,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:13:23,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-09 11:13:23,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:23,405 INFO L225 Difference]: With dead ends: 64 [2018-12-09 11:13:23,405 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 11:13:23,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:13:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 11:13:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-09 11:13:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 11:13:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-12-09 11:13:23,407 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 28 [2018-12-09 11:13:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:23,407 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-12-09 11:13:23,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:13:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-12-09 11:13:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 11:13:23,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:23,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:23,408 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 11:13:23,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:23,409 INFO L82 PathProgramCache]: Analyzing trace with hash -625732417, now seen corresponding path program 1 times [2018-12-09 11:13:23,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:13:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:23,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:23,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:13:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:23,438 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 11:13:23,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:23,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:13:23,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:13:23,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:13:23,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:13:23,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:13:23,439 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-12-09 11:13:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:23,452 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-12-09 11:13:23,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:13:23,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-09 11:13:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:23,453 INFO L225 Difference]: With dead ends: 62 [2018-12-09 11:13:23,453 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 11:13:23,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:13:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 11:13:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-12-09 11:13:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 11:13:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-09 11:13:23,454 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 30 [2018-12-09 11:13:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:23,455 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-09 11:13:23,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:13:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-09 11:13:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 11:13:23,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:23,455 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] [2018-12-09 11:13:23,455 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 11:13:23,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:23,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1749286155, now seen corresponding path program 1 times [2018-12-09 11:13:23,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:13:23,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:23,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:23,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:23,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:13:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:13:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:13:23,482 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 11:13:23,490 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 11:13:23,496 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT~~A?p~*VOID# [2018-12-09 11:13:23,497 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 11:13:23,497 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 11:13:23,497 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~A?p~*VOID# [2018-12-09 11:13:23,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:13:23 BoogieIcfgContainer [2018-12-09 11:13:23,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:13:23,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:13:23,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:13:23,504 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:13:23,504 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:13:21" (3/4) ... [2018-12-09 11:13:23,507 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 11:13:23,507 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:13:23,507 INFO L168 Benchmark]: Toolchain (without parser) took 2325.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2018-12-09 11:13:23,508 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:13:23,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-09 11:13:23,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.42 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 11:13:23,509 INFO L168 Benchmark]: Boogie Preprocessor took 17.64 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 11:13:23,509 INFO L168 Benchmark]: RCFGBuilder took 204.94 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: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-09 11:13:23,509 INFO L168 Benchmark]: TraceAbstraction took 1750.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-09 11:13:23,510 INFO L168 Benchmark]: Witness Printer took 3.12 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 11:13:23,511 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.42 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 17.64 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 204.94 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: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1750.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.12 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: IntegerLiteral 14 could not be translated for associated CType STRUCT~~A?p~*VOID# - 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# - 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 17 could not be translated for associated CType STRUCT~~A?p~*VOID# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1478]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1478. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L1467] struct A a6; VAL [\old(a6)=null, \old(a6)=null, \old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, a6={15:0}, ldv_global_msg_list={13:0}] [L1479] CALL entry_point() VAL [a6={15:0}, ldv_global_msg_list={13:0}] [L1471] CALL, EXPR probe2_6(&a6) VAL [a={15:0}, a6={15:0}, ldv_global_msg_list={13:0}] [L1444] int ret = - -3; VAL [a={15:0}, a={15:0}, a6={15:0}, ldv_global_msg_list={13:0}, ret=3] [L1445] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={15:0}, ldv_global_msg_list={13:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={12:0}, a6={15:0}, ldv_global_msg_list={13:0}, malloc(size)={12:0}, size=4] [L1445] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={15:0}, a={15:0}, a6={15:0}, ldv_global_msg_list={13:0}, ldv_malloc(sizeof(int))={12:0}, ret=3] [L1445] int *p = (int *)ldv_malloc(sizeof(int)); [L1446] COND FALSE !(p==0) VAL [a={15:0}, a={15:0}, a6={15:0}, ldv_global_msg_list={13:0}, p={12:0}, ret=3] [L1448] CALL, EXPR f6() VAL [a6={15:0}, ldv_global_msg_list={13:0}] [L1435] return __VERIFIER_nondet_int(); [L1448] RET, EXPR f6() VAL [a={15:0}, a={15:0}, a6={15:0}, f6()=0, ldv_global_msg_list={13:0}, p={12:0}, ret=3] [L1448] ret = f6() [L1449] COND FALSE !(ret<0) VAL [a={15:0}, a={15:0}, a6={15:0}, ldv_global_msg_list={13:0}, p={12:0}, ret=0] [L1451] CALL, EXPR g6() VAL [a6={15:0}, ldv_global_msg_list={13:0}] [L1439] return __VERIFIER_nondet_int(); [L1451] RET, EXPR g6() VAL [a={15:0}, a={15:0}, a6={15:0}, g6()=-1, ldv_global_msg_list={13:0}, p={12:0}, ret=0] [L1451] ret = g6() [L1452] COND TRUE ret<0 [L1453] return ret; VAL [\result=-1, a={15:0}, a={15:0}, a6={15:0}, ldv_global_msg_list={13:0}, p={12:0}, ret=-1] [L1471] RET, EXPR probe2_6(&a6) VAL [a6={15:0}, ldv_global_msg_list={13:0}, probe2_6(&a6)=-1] [L1471] int ret = probe2_6(&a6); [L1472] COND FALSE !(ret==0) VAL [a6={15:0}, ldv_global_msg_list={13:0}, ret=-1] [L1475] a6.p = 0 VAL [a6={15:0}, ldv_global_msg_list={13:0}, ret=-1] [L1479] RET entry_point() VAL [a6={15:0}, ldv_global_msg_list={13:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 60 locations, 11 error locations. UNSAFE Result, 1.7s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 676 SDtfs, 521 SDslu, 1490 SDs, 0 SdLazy, 772 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 71 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 28444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 11:13:24,869 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:13:24,870 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:13:24,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:13:24,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:13:24,877 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:13:24,877 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:13:24,878 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:13:24,879 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:13:24,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:13:24,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:13:24,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:13:24,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:13:24,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:13:24,881 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:13:24,882 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:13:24,882 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:13:24,883 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:13:24,884 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:13:24,885 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:13:24,886 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:13:24,887 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:13:24,888 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:13:24,889 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:13:24,889 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:13:24,889 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:13:24,890 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:13:24,890 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:13:24,890 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:13:24,891 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:13:24,891 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:13:24,891 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:13:24,891 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:13:24,892 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:13:24,892 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:13:24,892 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:13:24,892 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 11:13:24,902 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:13:24,903 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:13:24,903 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:13:24,903 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:13:24,904 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 11:13:24,904 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 11:13:24,904 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 11:13:24,904 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 11:13:24,904 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 11:13:24,904 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 11:13:24,905 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 11:13:24,905 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 11:13:24,905 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:13:24,905 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:13:24,906 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 11:13:24,906 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:13:24,906 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:13:24,906 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:13:24,906 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 11:13:24,906 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 11:13:24,906 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 11:13:24,907 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:13:24,907 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 11:13:24,907 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 11:13:24,907 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:13:24,907 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 11:13:24,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:13:24,908 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:13:24,908 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:13:24,908 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:13:24,908 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:13:24,908 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:13:24,908 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:13:24,908 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 11:13:24,909 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:13:24,909 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 11:13:24,909 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_1e726467-b32f-4c36-9630-d7017f9dde60/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 -> feda0632364bc935bd065aa8fb45d18a1f6a230c [2018-12-09 11:13:24,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:13:24,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:13:24,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:13:24,947 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:13:24,948 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:13:24,948 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-12-09 11:13:24,985 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/data/006469a3c/bebea681e1e14dc098967c21e3a2ee48/FLAG44c7b245c [2018-12-09 11:13:25,443 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:13:25,444 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/sv-benchmarks/c/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-12-09 11:13:25,451 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/data/006469a3c/bebea681e1e14dc098967c21e3a2ee48/FLAG44c7b245c [2018-12-09 11:13:25,459 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/data/006469a3c/bebea681e1e14dc098967c21e3a2ee48 [2018-12-09 11:13:25,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:13:25,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:13:25,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:13:25,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:13:25,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:13:25,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:13:25" (1/1) ... [2018-12-09 11:13:25,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4096dacc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:25, skipping insertion in model container [2018-12-09 11:13:25,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:13:25" (1/1) ... [2018-12-09 11:13:25,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:13:25,492 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:13:25,688 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:13:25,733 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:13:25,770 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:13:25,809 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:13:25,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:25 WrapperNode [2018-12-09 11:13:25,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:13:25,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:13:25,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:13:25,810 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:13:25,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:25" (1/1) ... [2018-12-09 11:13:25,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:25" (1/1) ... [2018-12-09 11:13:25,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:13:25,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:13:25,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:13:25,831 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:13:25,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:25" (1/1) ... [2018-12-09 11:13:25,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:25" (1/1) ... [2018-12-09 11:13:25,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:25" (1/1) ... [2018-12-09 11:13:25,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:25" (1/1) ... [2018-12-09 11:13:25,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:25" (1/1) ... [2018-12-09 11:13:25,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:25" (1/1) ... [2018-12-09 11:13:25,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:25" (1/1) ... [2018-12-09 11:13:25,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:13:25,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:13:25,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:13:25,849 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:13:25,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 11:13:25,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:13:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 11:13:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 11:13:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 11:13:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 11:13:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 11:13:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 11:13:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 11:13:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2018-12-09 11:13:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2018-12-09 11:13:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 11:13:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2018-12-09 11:13:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2018-12-09 11:13:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure probe2_6 [2018-12-09 11:13:25,881 INFO L138 BoogieDeclarations]: Found implementation of procedure probe2_6 [2018-12-09 11:13:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 11:13:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 11:13:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 11:13:25,881 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 11:13:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:13:25,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:13:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-12-09 11:13:25,881 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-12-09 11:13:26,076 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:13:26,076 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 11:13:26,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:13:26 BoogieIcfgContainer [2018-12-09 11:13:26,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:13:26,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:13:26,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:13:26,078 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:13:26,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:13:25" (1/3) ... [2018-12-09 11:13:26,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4754461e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:13:26, skipping insertion in model container [2018-12-09 11:13:26,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:25" (2/3) ... [2018-12-09 11:13:26,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4754461e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:13:26, skipping insertion in model container [2018-12-09 11:13:26,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:13:26" (3/3) ... [2018-12-09 11:13:26,080 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-12-09 11:13:26,085 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:13:26,090 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-12-09 11:13:26,098 INFO L257 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2018-12-09 11:13:26,112 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 11:13:26,112 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:13:26,113 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 11:13:26,113 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:13:26,113 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:13:26,113 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:13:26,113 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:13:26,113 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:13:26,113 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:13:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-12-09 11:13:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 11:13:26,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:26,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:26,131 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION]=== [2018-12-09 11:13:26,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1945648776, now seen corresponding path program 1 times [2018-12-09 11:13:26,139 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:13:26,139 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 11:13:26,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:26,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:13:26,242 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 11:13:26,242 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:13:26,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:26,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:13:26,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:13:26,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:13:26,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:13:26,257 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 5 states. [2018-12-09 11:13:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:26,314 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-12-09 11:13:26,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:13:26,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 11:13:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:26,324 INFO L225 Difference]: With dead ends: 79 [2018-12-09 11:13:26,324 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 11:13:26,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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 11:13:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 11:13:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2018-12-09 11:13:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 11:13:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-12-09 11:13:26,354 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 20 [2018-12-09 11:13:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:26,354 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-12-09 11:13:26,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:13:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-12-09 11:13:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 11:13:26,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:26,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:26,355 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION]=== [2018-12-09 11:13:26,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:26,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2142162281, now seen corresponding path program 1 times [2018-12-09 11:13:26,356 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:13:26,356 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 11:13:26,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:26,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:13:26,431 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 12 treesize of output 15 [2018-12-09 11:13:26,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:26,447 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 11:13:26,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:26,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:26,461 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 11:13:26,462 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 11:13:26,494 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-09 11:13:26,494 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:26,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:13:26,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:13:26,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 11:13:26,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:12, output treesize:44 [2018-12-09 11:13:26,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 11:13:26,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:26,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:13:26,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-09 11:13:26,587 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 11:13:26,587 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:13:26,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:26,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:26,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:13:26,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:13:26,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:13:26,591 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 4 states. [2018-12-09 11:13:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:26,748 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-12-09 11:13:26,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:13:26,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 11:13:26,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:26,750 INFO L225 Difference]: With dead ends: 100 [2018-12-09 11:13:26,750 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 11:13:26,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:13:26,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 11:13:26,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2018-12-09 11:13:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 11:13:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2018-12-09 11:13:26,757 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 20 [2018-12-09 11:13:26,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:26,757 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2018-12-09 11:13:26,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:13:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2018-12-09 11:13:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 11:13:26,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:26,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:26,759 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION]=== [2018-12-09 11:13:26,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:26,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2142162280, now seen corresponding path program 1 times [2018-12-09 11:13:26,760 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:13:26,760 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 11:13:26,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:26,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:13:26,831 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 9 treesize of output 12 [2018-12-09 11:13:26,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:26,843 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 11:13:26,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 11:13:26,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 11:13:26,871 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 11:13:26,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:24 [2018-12-09 11:13:26,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 11:13:26,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:26,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:13:26,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-09 11:13:26,920 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 11:13:26,920 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:13:26,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:26,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:26,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:13:26,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:13:26,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:13:26,922 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand 4 states. [2018-12-09 11:13:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:27,050 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-12-09 11:13:27,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:13:27,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 11:13:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:27,051 INFO L225 Difference]: With dead ends: 112 [2018-12-09 11:13:27,051 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 11:13:27,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:13:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 11:13:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2018-12-09 11:13:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 11:13:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-12-09 11:13:27,057 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 20 [2018-12-09 11:13:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:27,057 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-12-09 11:13:27,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:13:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-12-09 11:13:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 11:13:27,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:27,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:27,058 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION]=== [2018-12-09 11:13:27,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:27,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1181178621, now seen corresponding path program 1 times [2018-12-09 11:13:27,058 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:13:27,058 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 11:13:27,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:27,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:13:27,108 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 11:13:27,108 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:13:27,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:27,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:13:27,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:13:27,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:13:27,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:13:27,110 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 5 states. [2018-12-09 11:13:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:27,133 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2018-12-09 11:13:27,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:13:27,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-09 11:13:27,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:27,134 INFO L225 Difference]: With dead ends: 97 [2018-12-09 11:13:27,134 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 11:13:27,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:13:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 11:13:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-09 11:13:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 11:13:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2018-12-09 11:13:27,139 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 22 [2018-12-09 11:13:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:27,139 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2018-12-09 11:13:27,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:13:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2018-12-09 11:13:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 11:13:27,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:27,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:27,140 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION]=== [2018-12-09 11:13:27,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:27,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1328667612, now seen corresponding path program 1 times [2018-12-09 11:13:27,140 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:13:27,140 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 11:13:27,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:27,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:13:27,196 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 11:13:27,196 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:13:27,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:27,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:13:27,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:13:27,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:13:27,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:13:27,198 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand 6 states. [2018-12-09 11:13:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:27,228 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2018-12-09 11:13:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:13:27,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-09 11:13:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:27,229 INFO L225 Difference]: With dead ends: 101 [2018-12-09 11:13:27,229 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 11:13:27,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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 11:13:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 11:13:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-09 11:13:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 11:13:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-12-09 11:13:27,236 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 22 [2018-12-09 11:13:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:27,236 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-12-09 11:13:27,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:13:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-12-09 11:13:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 11:13:27,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:27,237 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 11:13:27,237 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION]=== [2018-12-09 11:13:27,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:27,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2038168316, now seen corresponding path program 1 times [2018-12-09 11:13:27,238 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:13:27,238 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 11:13:27,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:27,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:13:27,301 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 11:13:27,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:27,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:13:27,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 11:13:27,337 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 11:13:27,337 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:13:27,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:27,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:13:27,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:13:27,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:13:27,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:13:27,339 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 6 states. [2018-12-09 11:13:27,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:27,482 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-12-09 11:13:27,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:13:27,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-09 11:13:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:27,483 INFO L225 Difference]: With dead ends: 108 [2018-12-09 11:13:27,483 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 11:13:27,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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 11:13:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 11:13:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2018-12-09 11:13:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 11:13:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2018-12-09 11:13:27,488 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 23 [2018-12-09 11:13:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:27,488 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2018-12-09 11:13:27,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:13:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2018-12-09 11:13:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 11:13:27,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:27,489 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 11:13:27,489 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION]=== [2018-12-09 11:13:27,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:27,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1963395973, now seen corresponding path program 1 times [2018-12-09 11:13:27,489 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:13:27,489 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 11:13:27,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:27,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:13:27,545 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 11:13:27,546 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:13:27,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:27,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:13:27,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:13:27,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:13:27,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:13:27,547 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 6 states. [2018-12-09 11:13:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:27,579 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-12-09 11:13:27,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:13:27,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-09 11:13:27,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:27,581 INFO L225 Difference]: With dead ends: 93 [2018-12-09 11:13:27,581 INFO L226 Difference]: Without dead ends: 92 [2018-12-09 11:13:27,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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 11:13:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-09 11:13:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-12-09 11:13:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 11:13:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2018-12-09 11:13:27,584 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 23 [2018-12-09 11:13:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:27,585 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2018-12-09 11:13:27,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:13:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2018-12-09 11:13:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:13:27,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:27,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:27,585 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION]=== [2018-12-09 11:13:27,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:27,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1747249740, now seen corresponding path program 1 times [2018-12-09 11:13:27,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:13:27,586 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 11:13:27,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:27,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:13:27,651 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 12 treesize of output 15 [2018-12-09 11:13:27,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:27,662 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 11:13:27,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:27,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:27,676 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 11:13:27,677 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 11:13:27,699 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-09 11:13:27,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:27,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:13:27,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:13:27,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 11:13:27,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:12, output treesize:44 [2018-12-09 11:13:29,816 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 11:13:29,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:29,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:29,823 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 19 treesize of output 23 [2018-12-09 11:13:29,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:29,829 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 11:13:29,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-12-09 11:13:29,914 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 11:13:29,915 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:13:29,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:29,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:13:29,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 11:13:29,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 11:13:29,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2018-12-09 11:13:29,917 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand 9 states. [2018-12-09 11:13:30,338 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 11:13:30,728 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 11:13:31,170 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 11:13:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:31,433 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-12-09 11:13:31,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 11:13:31,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-09 11:13:31,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:31,435 INFO L225 Difference]: With dead ends: 104 [2018-12-09 11:13:31,435 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 11:13:31,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=60, Invalid=125, Unknown=1, NotChecked=24, Total=210 [2018-12-09 11:13:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 11:13:31,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-12-09 11:13:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 11:13:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2018-12-09 11:13:31,438 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 28 [2018-12-09 11:13:31,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:31,438 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-12-09 11:13:31,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 11:13:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2018-12-09 11:13:31,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:13:31,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:31,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:31,439 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION]=== [2018-12-09 11:13:31,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:31,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1747249739, now seen corresponding path program 1 times [2018-12-09 11:13:31,440 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:13:31,440 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 11:13:31,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:31,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:13:31,507 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 9 treesize of output 12 [2018-12-09 11:13:31,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:31,519 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 11:13:31,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 11:13:31,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 11:13:31,543 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 12 treesize of output 15 [2018-12-09 11:13:31,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:31,554 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 11:13:31,557 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-09 11:13:31,558 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:31,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:31,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:31,584 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 11:13:31,584 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 11:13:31,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:13:31,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:13:31,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-12-09 11:13:31,647 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:25, output treesize:143 [2018-12-09 11:13:33,500 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 11:13:33,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:33,511 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 28 treesize of output 31 [2018-12-09 11:13:33,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:33,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:33,603 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 32 treesize of output 35 [2018-12-09 11:13:33,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:33,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:33,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:33,675 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 27 treesize of output 21 [2018-12-09 11:13:33,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:33,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:33,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:33,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:33,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-12-09 11:13:33,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:33,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:33,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:33,843 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 32 treesize of output 24 [2018-12-09 11:13:33,843 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:33,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:33,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:33,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2018-12-09 11:13:33,925 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 11:13:33,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:13:33,986 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:93, output treesize:40 [2018-12-09 11:13:34,056 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 11:13:34,056 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:13:34,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:34,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:13:34,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 11:13:34,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 11:13:34,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=39, Unknown=1, NotChecked=12, Total=72 [2018-12-09 11:13:34,058 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 9 states. [2018-12-09 11:13:39,188 WARN L180 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 36 [2018-12-09 11:13:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:41,158 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-12-09 11:13:41,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 11:13:41,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-09 11:13:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:41,160 INFO L225 Difference]: With dead ends: 101 [2018-12-09 11:13:41,160 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 11:13:41,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=59, Invalid=124, Unknown=3, NotChecked=24, Total=210 [2018-12-09 11:13:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 11:13:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 88. [2018-12-09 11:13:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-09 11:13:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2018-12-09 11:13:41,163 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 28 [2018-12-09 11:13:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:41,163 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-12-09 11:13:41,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 11:13:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-12-09 11:13:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:13:41,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:41,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:41,165 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION]=== [2018-12-09 11:13:41,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:41,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2136961550, now seen corresponding path program 1 times [2018-12-09 11:13:41,165 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:13:41,165 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/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 11:13:41,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:41,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:13:41,226 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 12 treesize of output 15 [2018-12-09 11:13:41,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:41,238 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 11:13:41,241 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-09 11:13:41,241 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:41,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:41,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:41,261 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 11:13:41,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 11:13:41,278 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:13:41,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:13:41,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 11:13:41,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:12, output treesize:44 [2018-12-09 11:13:41,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 11:13:41,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:41,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:13:41,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-09 11:13:41,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:41,370 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 11:13:41,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:41,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:41,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-12-09 11:13:41,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:41,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 11:13:41,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-12-09 11:13:42,417 WARN L854 $PredicateComparison]: unable to prove that (exists ((probe2_6_~p~0.base (_ BitVec 32))) (and (not (= probe2_6_~p~0.base (_ bv0 32))) (= (store |c_old(#valid)| probe2_6_~p~0.base (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| probe2_6_~p~0.base)))) is different from true [2018-12-09 11:13:42,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:42,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:42,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 11:13:42,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:42,432 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 11:13:42,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-12-09 11:13:42,451 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 11:13:42,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:13:42,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:42,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 11:13:42,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 11:13:42,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 11:13:42,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=81, Unknown=1, NotChecked=18, Total=132 [2018-12-09 11:13:42,454 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 12 states. [2018-12-09 11:13:53,098 WARN L180 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-12-09 11:13:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:57,363 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-12-09 11:13:57,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 11:13:57,363 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-09 11:13:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:57,364 INFO L225 Difference]: With dead ends: 105 [2018-12-09 11:13:57,364 INFO L226 Difference]: Without dead ends: 102 [2018-12-09 11:13:57,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2018-12-09 11:13:57,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-09 11:13:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2018-12-09 11:13:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 11:13:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-12-09 11:13:57,369 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 28 [2018-12-09 11:13:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:57,369 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-12-09 11:13:57,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 11:13:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-12-09 11:13:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:13:57,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:57,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:57,370 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION]=== [2018-12-09 11:13:57,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:57,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2136961549, now seen corresponding path program 1 times [2018-12-09 11:13:57,371 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:13:57,371 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:13:57,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:57,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:13:57,444 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 9 treesize of output 12 [2018-12-09 11:13:57,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:57,457 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 11:13:57,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 11:13:57,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 11:13:57,482 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 12 treesize of output 15 [2018-12-09 11:13:57,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:57,497 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 11:13:57,501 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-09 11:13:57,501 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:57,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:57,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:57,528 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-09 11:13:57,528 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 11:13:57,545 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:13:57,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:13:57,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-12-09 11:13:57,591 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:25, output treesize:143 [2018-12-09 11:13:57,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 20 [2018-12-09 11:13:57,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:57,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:57,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:13:57,685 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 20 treesize of output 14 [2018-12-09 11:13:57,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:57,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 10 [2018-12-09 11:13:57,729 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:57,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:13:57,737 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:69, output treesize:10 [2018-12-09 11:13:59,242 WARN L180 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-09 11:13:59,248 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 11:13:59,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:59,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 11:13:59,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:13:59,259 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 11:13:59,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:3 [2018-12-09 11:14:00,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 47 [2018-12-09 11:14:00,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 11:14:00,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,307 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 30 treesize of output 33 [2018-12-09 11:14:00,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:14:00,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,400 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 30 treesize of output 33 [2018-12-09 11:14:00,401 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:14:00,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,469 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 29 treesize of output 23 [2018-12-09 11:14:00,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:14:00,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,473 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 27 treesize of output 21 [2018-12-09 11:14:00,473 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 11:14:00,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-12-09 11:14:00,535 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 11:14:00,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:14:00,597 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 29 treesize of output 21 [2018-12-09 11:14:00,597 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 11:14:00,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:14:00,652 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:91, output treesize:40 [2018-12-09 11:14:02,169 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 11:14:02,169 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:14:02,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:14:02,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:14:02,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:14:02,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:14:02,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=23, Unknown=3, NotChecked=0, Total=42 [2018-12-09 11:14:02,172 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 7 states. [2018-12-09 11:14:09,154 WARN L180 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-09 11:14:17,419 WARN L180 SmtUtils]: Spent 866.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 11:14:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:14:46,044 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-12-09 11:14:46,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:14:46,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-09 11:14:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:14:46,045 INFO L225 Difference]: With dead ends: 106 [2018-12-09 11:14:46,045 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 11:14:46,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=40, Invalid=61, Unknown=9, NotChecked=0, Total=110 [2018-12-09 11:14:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 11:14:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2018-12-09 11:14:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 11:14:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-12-09 11:14:46,048 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 28 [2018-12-09 11:14:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:14:46,048 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-12-09 11:14:46,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:14:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-12-09 11:14:46,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 11:14:46,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:14:46,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:14:46,049 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION]=== [2018-12-09 11:14:46,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:14:46,049 INFO L82 PathProgramCache]: Analyzing trace with hash -625732417, now seen corresponding path program 1 times [2018-12-09 11:14:46,049 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:14:46,049 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:14:46,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:14:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:14:46,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:14:46,121 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 11:14:46,121 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:14:46,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:14:46,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:14:46,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:14:46,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:14:46,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:14:46,123 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 6 states. [2018-12-09 11:14:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:14:46,140 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-12-09 11:14:46,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:14:46,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-09 11:14:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:14:46,141 INFO L225 Difference]: With dead ends: 86 [2018-12-09 11:14:46,141 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 11:14:46,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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 11:14:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 11:14:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-12-09 11:14:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 11:14:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-12-09 11:14:46,143 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 30 [2018-12-09 11:14:46,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:14:46,143 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-12-09 11:14:46,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:14:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-12-09 11:14:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 11:14:46,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:14:46,144 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] [2018-12-09 11:14:46,144 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, probe2_6Err3ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe2_6Err0REQUIRES_VIOLATION, probe2_6Err1REQUIRES_VIOLATION]=== [2018-12-09 11:14:46,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:14:46,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1749286155, now seen corresponding path program 1 times [2018-12-09 11:14:46,144 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:14:46,144 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e726467-b32f-4c36-9630-d7017f9dde60/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:14:46,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:14:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:14:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:14:46,291 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 11:14:46,299 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 11:14:46,305 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 11:14:46,305 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# [2018-12-09 11:14:46,305 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 11:14:46,305 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~A?p~*VOID# [2018-12-09 11:14:46,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:14:46 BoogieIcfgContainer [2018-12-09 11:14:46,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:14:46,312 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:14:46,312 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:14:46,312 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:14:46,312 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:13:26" (3/4) ... [2018-12-09 11:14:46,315 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 11:14:46,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:14:46,315 INFO L168 Benchmark]: Toolchain (without parser) took 80853.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.7 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -103.8 MB). Peak memory consumption was 191.9 MB. Max. memory is 11.5 GB. [2018-12-09 11:14:46,315 INFO L168 Benchmark]: CDTParser took 0.19 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 11:14:46,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-09 11:14:46,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.35 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 11:14:46,316 INFO L168 Benchmark]: Boogie Preprocessor took 17.61 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 11:14:46,316 INFO L168 Benchmark]: RCFGBuilder took 227.44 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: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2018-12-09 11:14:46,316 INFO L168 Benchmark]: TraceAbstraction took 80235.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.8 MB). Peak memory consumption was 184.3 MB. Max. memory is 11.5 GB. [2018-12-09 11:14:46,316 INFO L168 Benchmark]: Witness Printer took 2.74 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:14:46,317 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.19 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 347.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.35 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 17.61 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 227.44 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: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 80235.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.8 MB). Peak memory consumption was 184.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.74 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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~~A?p~*VOID# - 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~~A?p~*VOID# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1478]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1478. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L1467] struct A a6; VAL [\old(a6)=null, \old(a6)=null, \old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, a6={3:0}, ldv_global_msg_list={1:0}] [L1479] CALL entry_point() VAL [a6={3:0}, ldv_global_msg_list={1:0}] [L1471] CALL, EXPR probe2_6(&a6) VAL [a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}] [L1444] int ret = - -3; VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, ret=3] [L1445] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={3:0}, ldv_global_msg_list={1:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={2:0}, a6={3:0}, ldv_global_msg_list={1:0}, malloc(size)={2:0}, size=4] [L1445] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(int))={2:0}, ret=3] [L1445] int *p = (int *)ldv_malloc(sizeof(int)); [L1446] COND FALSE !(p==0) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, p={2:0}, ret=3] [L1448] CALL, EXPR f6() VAL [a6={3:0}, ldv_global_msg_list={1:0}] [L1435] return __VERIFIER_nondet_int(); [L1448] RET, EXPR f6() VAL [a={3:0}, a={3:0}, a6={3:0}, f6()=0, ldv_global_msg_list={1:0}, p={2:0}, ret=3] [L1448] ret = f6() [L1449] COND FALSE !(ret<0) VAL [a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, p={2:0}, ret=0] [L1451] CALL, EXPR g6() VAL [a6={3:0}, ldv_global_msg_list={1:0}] [L1439] return __VERIFIER_nondet_int(); [L1451] RET, EXPR g6() VAL [a={3:0}, a={3:0}, a6={3:0}, g6()=-2147483648, ldv_global_msg_list={1:0}, p={2:0}, ret=0] [L1451] ret = g6() [L1452] COND TRUE ret<0 [L1453] return ret; VAL [\result=-2147483648, a={3:0}, a={3:0}, a6={3:0}, ldv_global_msg_list={1:0}, p={2:0}, ret=2147483648] [L1471] RET, EXPR probe2_6(&a6) VAL [a6={3:0}, ldv_global_msg_list={1:0}, probe2_6(&a6)=-2147483648] [L1471] int ret = probe2_6(&a6); [L1472] COND FALSE !(ret==0) VAL [a6={3:0}, ldv_global_msg_list={1:0}, ret=2147483648] [L1475] a6.p = 0 VAL [a6={3:0}, ldv_global_msg_list={1:0}, ret=2147483648] [L1479] RET entry_point() VAL [a6={3:0}, ldv_global_msg_list={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 60 locations, 11 error locations. UNSAFE Result, 80.2s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 68.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 743 SDtfs, 774 SDslu, 1683 SDs, 0 SdLazy, 1053 SolverSat, 248 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 44.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 211 SyntacticMatches, 14 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 32.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 133 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 280 ConstructedInterpolants, 47 QuantifiedInterpolants, 57896 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1264 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...