./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/freeAlloca_false-valid-free.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/freeAlloca_false-valid-free.c -s /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/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 2749915c63b6e758ac6033a38fbdad80769d2869 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:37:14,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:37:14,073 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:37:14,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:37:14,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:37:14,082 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:37:14,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:37:14,083 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:37:14,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:37:14,085 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:37:14,086 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:37:14,086 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:37:14,087 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:37:14,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:37:14,088 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:37:14,089 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:37:14,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:37:14,091 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:37:14,092 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:37:14,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:37:14,095 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:37:14,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:37:14,097 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:37:14,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:37:14,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:37:14,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:37:14,099 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:37:14,100 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:37:14,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:37:14,101 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:37:14,102 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:37:14,102 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:37:14,102 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:37:14,102 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:37:14,103 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:37:14,103 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:37:14,103 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-10 10:37:14,112 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:37:14,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:37:14,113 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:37:14,113 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:37:14,113 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:37:14,113 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:37:14,113 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 10:37:14,114 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:37:14,114 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 10:37:14,114 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 10:37:14,114 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:37:14,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:37:14,115 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:37:14,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:37:14,115 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:37:14,115 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:37:14,115 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:37:14,116 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:37:14,116 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:37:14,116 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 10:37:14,116 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 10:37:14,116 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 10:37:14,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:37:14,116 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:37:14,117 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:37:14,117 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:37:14,117 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:37:14,117 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:37:14,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:37:14,119 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:37:14,119 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:37:14,120 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 10:37:14,120 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:37:14,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:37:14,120 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_56602664-501d-4b60-9069-701503b723b1/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 -> 2749915c63b6e758ac6033a38fbdad80769d2869 [2018-11-10 10:37:14,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:37:14,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:37:14,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:37:14,156 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:37:14,157 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:37:14,157 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/freeAlloca_false-valid-free.c [2018-11-10 10:37:14,205 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/data/de90f36c5/aa4f892cca6b4927945972df54a6461a/FLAG3a44ed765 [2018-11-10 10:37:14,525 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:37:14,526 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/sv-benchmarks/c/memsafety-ext3/freeAlloca_false-valid-free.c [2018-11-10 10:37:14,530 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/data/de90f36c5/aa4f892cca6b4927945972df54a6461a/FLAG3a44ed765 [2018-11-10 10:37:14,542 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/data/de90f36c5/aa4f892cca6b4927945972df54a6461a [2018-11-10 10:37:14,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:37:14,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:37:14,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:37:14,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:37:14,549 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:37:14,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:37:14" (1/1) ... [2018-11-10 10:37:14,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656f031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:14, skipping insertion in model container [2018-11-10 10:37:14,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:37:14" (1/1) ... [2018-11-10 10:37:14,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:37:14,574 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:37:14,676 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:37:14,682 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:37:14,691 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:37:14,699 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:37:14,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:14 WrapperNode [2018-11-10 10:37:14,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:37:14,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:37:14,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:37:14,700 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:37:14,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:14" (1/1) ... [2018-11-10 10:37:14,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:14" (1/1) ... [2018-11-10 10:37:14,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:37:14,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:37:14,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:37:14,722 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:37:14,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:14" (1/1) ... [2018-11-10 10:37:14,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:14" (1/1) ... [2018-11-10 10:37:14,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:14" (1/1) ... [2018-11-10 10:37:14,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:14" (1/1) ... [2018-11-10 10:37:14,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:14" (1/1) ... [2018-11-10 10:37:14,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:14" (1/1) ... [2018-11-10 10:37:14,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:14" (1/1) ... [2018-11-10 10:37:14,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:37:14,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:37:14,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:37:14,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:37:14,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/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-11-10 10:37:14,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:37:14,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:37:14,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:37:14,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:37:14,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:37:14,807 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:37:14,930 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:37:14,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:37:14 BoogieIcfgContainer [2018-11-10 10:37:14,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:37:14,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:37:14,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:37:14,933 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:37:14,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:37:14" (1/3) ... [2018-11-10 10:37:14,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e10d61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:37:14, skipping insertion in model container [2018-11-10 10:37:14,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:14" (2/3) ... [2018-11-10 10:37:14,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e10d61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:37:14, skipping insertion in model container [2018-11-10 10:37:14,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:37:14" (3/3) ... [2018-11-10 10:37:14,936 INFO L112 eAbstractionObserver]: Analyzing ICFG freeAlloca_false-valid-free.c [2018-11-10 10:37:14,944 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:37:14,950 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-10 10:37:14,960 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-10 10:37:14,977 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:37:14,977 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 10:37:14,977 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:37:14,977 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:37:14,977 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:37:14,977 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:37:14,978 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:37:14,978 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:37:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-10 10:37:14,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 10:37:14,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:14,997 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:14,999 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-10 10:37:15,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash -935793955, now seen corresponding path program 1 times [2018-11-10 10:37:15,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:37:15,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:15,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:15,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:15,041 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:37:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:15,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:15,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:37:15,087 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:37:15,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 10:37:15,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 10:37:15,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:37:15,103 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-10 10:37:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:15,116 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-10 10:37:15,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:37:15,117 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-10 10:37:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:15,124 INFO L225 Difference]: With dead ends: 29 [2018-11-10 10:37:15,125 INFO L226 Difference]: Without dead ends: 26 [2018-11-10 10:37:15,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:37:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-10 10:37:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-10 10:37:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 10:37:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-10 10:37:15,149 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 9 [2018-11-10 10:37:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:15,149 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-10 10:37:15,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 10:37:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-10 10:37:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 10:37:15,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:15,150 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:15,151 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-10 10:37:15,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash -935806768, now seen corresponding path program 1 times [2018-11-10 10:37:15,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:37:15,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:15,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:15,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:15,152 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:37:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:15,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:15,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:37:15,203 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:37:15,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:15,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:15,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:15,205 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 4 states. [2018-11-10 10:37:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:15,288 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-10 10:37:15,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:15,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-10 10:37:15,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:15,289 INFO L225 Difference]: With dead ends: 37 [2018-11-10 10:37:15,289 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 10:37:15,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-10 10:37:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 10:37:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-11-10 10:37:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 10:37:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-10 10:37:15,292 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 9 [2018-11-10 10:37:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:15,292 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-10 10:37:15,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-10 10:37:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 10:37:15,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:15,293 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:15,293 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-10 10:37:15,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:15,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1054759646, now seen corresponding path program 1 times [2018-11-10 10:37:15,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:37:15,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:15,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:15,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:15,294 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:37:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:15,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:15,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:37:15,325 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:37:15,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:37:15,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:37:15,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:37:15,326 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-11-10 10:37:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:15,334 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-10 10:37:15,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:37:15,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 10:37:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:15,335 INFO L225 Difference]: With dead ends: 30 [2018-11-10 10:37:15,335 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 10:37:15,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:37:15,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 10:37:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-10 10:37:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 10:37:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-10 10:37:15,338 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-11-10 10:37:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:15,339 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-10 10:37:15,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:37:15,339 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-10 10:37:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 10:37:15,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:15,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:15,340 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-10 10:37:15,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:15,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1054761312, now seen corresponding path program 1 times [2018-11-10 10:37:15,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:37:15,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:15,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:15,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:15,341 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:37:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:15,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:15,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:37:15,396 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:37:15,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:15,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:15,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:15,397 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 4 states. [2018-11-10 10:37:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:15,451 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-10 10:37:15,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:37:15,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-10 10:37:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:15,452 INFO L225 Difference]: With dead ends: 43 [2018-11-10 10:37:15,452 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 10:37:15,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-10 10:37:15,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 10:37:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-11-10 10:37:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 10:37:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-10 10:37:15,454 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 10 [2018-11-10 10:37:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:15,455 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-10 10:37:15,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-10 10:37:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 10:37:15,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:15,455 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:15,455 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-10 10:37:15,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:15,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2003144521, now seen corresponding path program 1 times [2018-11-10 10:37:15,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:37:15,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:15,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:15,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:15,456 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:37:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:37:15,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:15,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:37:15,477 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:37:15,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:15,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:15,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:15,480 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 4 states. [2018-11-10 10:37:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:15,502 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-10 10:37:15,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:15,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-10 10:37:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:15,503 INFO L225 Difference]: With dead ends: 28 [2018-11-10 10:37:15,503 INFO L226 Difference]: Without dead ends: 28 [2018-11-10 10:37:15,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-10 10:37:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-10 10:37:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-10 10:37:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 10:37:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-10 10:37:15,507 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 15 [2018-11-10 10:37:15,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:15,507 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-10 10:37:15,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-10 10:37:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 10:37:15,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:15,508 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:15,508 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-10 10:37:15,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:15,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2003142855, now seen corresponding path program 1 times [2018-11-10 10:37:15,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:37:15,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:15,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:15,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:15,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:37:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:15,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:15,602 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:37:15,603 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-11-10 10:37:15,604 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [16], [17], [18], [20], [42], [43], [44] [2018-11-10 10:37:15,638 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:37:15,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:37:16,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:37:16,083 INFO L272 AbstractInterpreter]: Visited 12 different actions 60 times. Merged at 6 different actions 48 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-11-10 10:37:16,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:16,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:37:16,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:16,091 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:37:16,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:16,097 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:37:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:16,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:16,142 INFO L477 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-11-10 10:37:16,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:16,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:16,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-11-10 10:37:16,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:16,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:37:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:16,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:37:16,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2018-11-10 10:37:16,281 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:37:16,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:37:16,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:37:16,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:37:16,282 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 10 states. [2018-11-10 10:37:16,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:16,560 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-10 10:37:16,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:37:16,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-11-10 10:37:16,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:16,561 INFO L225 Difference]: With dead ends: 43 [2018-11-10 10:37:16,561 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 10:37:16,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:37:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 10:37:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-11-10 10:37:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 10:37:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-10 10:37:16,563 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2018-11-10 10:37:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:16,563 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-10 10:37:16,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:37:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-10 10:37:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 10:37:16,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:16,564 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:16,564 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-10 10:37:16,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:16,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1366570364, now seen corresponding path program 1 times [2018-11-10 10:37:16,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:37:16,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:16,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:16,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:16,565 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:37:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:16,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:16,590 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:37:16,590 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-10 10:37:16,590 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [18], [20], [24], [26], [27], [42], [43], [44] [2018-11-10 10:37:16,592 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:37:16,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:37:16,891 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:37:16,891 INFO L272 AbstractInterpreter]: Visited 15 different actions 69 times. Merged at 5 different actions 45 times. Widened at 1 different actions 5 times. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-11-10 10:37:16,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:16,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:37:16,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:16,913 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:37:16,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:16,921 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:37:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:16,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:16,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:37:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:16,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:37:16,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-10 10:37:16,982 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:37:16,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:37:16,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:37:16,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:37:16,983 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 6 states. [2018-11-10 10:37:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:16,994 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-10 10:37:16,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:37:16,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-10 10:37:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:16,996 INFO L225 Difference]: With dead ends: 36 [2018-11-10 10:37:16,996 INFO L226 Difference]: Without dead ends: 36 [2018-11-10 10:37:16,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:37:16,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-10 10:37:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-10 10:37:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 10:37:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-10 10:37:16,999 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 21 [2018-11-10 10:37:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:16,999 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-10 10:37:16,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:37:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-10 10:37:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 10:37:17,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:17,000 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:17,000 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-10 10:37:17,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:17,000 INFO L82 PathProgramCache]: Analyzing trace with hash -228708861, now seen corresponding path program 2 times [2018-11-10 10:37:17,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:37:17,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:17,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:17,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:17,001 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:37:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:17,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:17,043 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:37:17,043 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:37:17,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:37:17,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:17,043 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:37:17,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:37:17,055 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:37:17,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 10:37:17,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:37:17,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:17,069 INFO L477 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-11-10 10:37:17,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:17,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:17,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 10:37:17,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:37:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 10:37:17,147 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:37:17,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 10 [2018-11-10 10:37:17,148 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:37:17,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:17,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:17,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:37:17,148 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 4 states. [2018-11-10 10:37:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:17,165 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-10 10:37:17,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:17,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-10 10:37:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:17,166 INFO L225 Difference]: With dead ends: 32 [2018-11-10 10:37:17,166 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 10:37:17,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:37:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 10:37:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-10 10:37:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 10:37:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-10 10:37:17,168 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2018-11-10 10:37:17,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:17,168 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-10 10:37:17,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-10 10:37:17,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 10:37:17,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:17,169 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:17,169 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-10 10:37:17,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:17,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1647479997, now seen corresponding path program 1 times [2018-11-10 10:37:17,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:37:17,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:17,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:37:17,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:17,170 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:37:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:17,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:17,214 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:37:17,214 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-10 10:37:17,214 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [18], [20], [24], [26], [28], [37], [39], [41], [42], [43], [44] [2018-11-10 10:37:17,215 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:37:17,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:37:17,453 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:37:17,453 INFO L272 AbstractInterpreter]: Visited 18 different actions 72 times. Merged at 5 different actions 45 times. Widened at 1 different actions 5 times. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-11-10 10:37:17,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:17,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:37:17,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:17,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:37:17,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:17,460 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:37:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:17,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:17,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:37:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:17,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:37:17,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-10 10:37:17,562 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:37:17,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:37:17,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:37:17,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:37:17,563 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2018-11-10 10:37:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:17,577 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-10 10:37:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:37:17,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-10 10:37:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:17,578 INFO L225 Difference]: With dead ends: 40 [2018-11-10 10:37:17,578 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 10:37:17,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:37:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 10:37:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-10 10:37:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 10:37:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-10 10:37:17,580 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 29 [2018-11-10 10:37:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:17,581 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-10 10:37:17,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:37:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-10 10:37:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 10:37:17,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:17,581 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:17,581 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-10 10:37:17,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:17,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1051331382, now seen corresponding path program 2 times [2018-11-10 10:37:17,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:37:17,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:17,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:17,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:17,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:37:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:17,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:17,631 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:37:17,631 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:37:17,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:37:17,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:17,631 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:37:17,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:37:17,646 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:37:17,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 10:37:17,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:37:17,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:17,694 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_ULTIMATE.dealloc_~addr.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_ULTIMATE.dealloc_~addr.base 0)) (= 0 (select |c_old(#valid)| main_ULTIMATE.dealloc_~addr.base)))) is different from true [2018-11-10 10:37:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 10:37:17,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:37:17,726 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_#Ultimate.alloc_#res.base_6| Int)) (or (= (store |c_#valid| |v_main_#Ultimate.alloc_#res.base_6| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#Ultimate.alloc_#res.base_6|) 0)))) is different from false [2018-11-10 10:37:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 10:37:17,747 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:37:17,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 12 [2018-11-10 10:37:17,747 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:37:17,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:37:17,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:37:17,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=64, Unknown=2, NotChecked=34, Total=132 [2018-11-10 10:37:17,748 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 5 states. [2018-11-10 10:37:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:17,793 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-10 10:37:17,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:37:17,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-10 10:37:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:17,794 INFO L225 Difference]: With dead ends: 39 [2018-11-10 10:37:17,794 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 10:37:17,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=80, Unknown=3, NotChecked=38, Total=156 [2018-11-10 10:37:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 10:37:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-10 10:37:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 10:37:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-10 10:37:17,796 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-11-10 10:37:17,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:17,797 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-10 10:37:17,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:37:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-10 10:37:17,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 10:37:17,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:17,798 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:17,798 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-10 10:37:17,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:17,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1017867930, now seen corresponding path program 1 times [2018-11-10 10:37:17,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:37:17,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:17,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:37:17,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:17,799 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:37:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:17,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:17,839 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:37:17,839 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-10 10:37:17,840 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [18], [20], [24], [26], [28], [31], [33], [35], [39], [41], [42], [43], [44] [2018-11-10 10:37:17,841 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:37:17,841 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:37:18,051 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:37:18,051 INFO L272 AbstractInterpreter]: Visited 20 different actions 74 times. Merged at 5 different actions 45 times. Widened at 1 different actions 5 times. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-11-10 10:37:18,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:18,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:37:18,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:18,053 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:37:18,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:18,058 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:37:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:18,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:18,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:37:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:18,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:37:18,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-10 10:37:18,141 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:37:18,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:37:18,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:37:18,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:37:18,142 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 8 states. [2018-11-10 10:37:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:18,156 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-10 10:37:18,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:37:18,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-11-10 10:37:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:18,157 INFO L225 Difference]: With dead ends: 45 [2018-11-10 10:37:18,157 INFO L226 Difference]: Without dead ends: 45 [2018-11-10 10:37:18,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:37:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-10 10:37:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-10 10:37:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 10:37:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-10 10:37:18,159 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2018-11-10 10:37:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:18,160 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-10 10:37:18,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:37:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-10 10:37:18,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 10:37:18,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:18,160 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:18,161 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-10 10:37:18,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:18,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1445435903, now seen corresponding path program 2 times [2018-11-10 10:37:18,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:37:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:18,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:18,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:18,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:37:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:18,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:18,211 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:37:18,211 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:37:18,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:37:18,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:37:18,211 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:37:18,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:37:18,226 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:37:18,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 10:37:18,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:37:18,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:18,286 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_ULTIMATE.dealloc_~addr.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_ULTIMATE.dealloc_~addr.base 0)) (= 0 (select |c_old(#valid)| main_ULTIMATE.dealloc_~addr.base)))) is different from true [2018-11-10 10:37:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 10:37:18,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:37:18,308 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_#Ultimate.alloc_#res.base_8| Int)) (or (not (= 0 (select |c_#valid| |v_main_#Ultimate.alloc_#res.base_8|))) (= (store |c_#valid| |v_main_#Ultimate.alloc_#res.base_8| 0) |c_old(#valid)|))) is different from false [2018-11-10 10:37:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 10:37:18,328 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:37:18,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [8] total 15 [2018-11-10 10:37:18,328 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:37:18,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:37:18,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:37:18,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=116, Unknown=2, NotChecked=46, Total=210 [2018-11-10 10:37:18,329 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 6 states. [2018-11-10 10:37:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:18,359 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-10 10:37:18,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:37:18,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-10 10:37:18,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:18,359 INFO L225 Difference]: With dead ends: 41 [2018-11-10 10:37:18,359 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 10:37:18,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=137, Unknown=3, NotChecked=50, Total=240 [2018-11-10 10:37:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 10:37:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 10:37:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 10:37:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 10:37:18,360 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-11-10 10:37:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:18,360 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:37:18,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:37:18,360 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:37:18,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 10:37:18,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:37:18 BoogieIcfgContainer [2018-11-10 10:37:18,363 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:37:18,363 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:37:18,363 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:37:18,364 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:37:18,364 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:37:14" (3/4) ... [2018-11-10 10:37:18,367 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 10:37:18,372 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 10:37:18,372 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 10:37:18,376 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2018-11-10 10:37:18,376 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-10 10:37:18,376 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-10 10:37:18,376 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 10:37:18,403 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_56602664-501d-4b60-9069-701503b723b1/bin-2019/utaipan/witness.graphml [2018-11-10 10:37:18,403 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:37:18,404 INFO L168 Benchmark]: Toolchain (without parser) took 3858.90 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.0 MB). Free memory was 959.2 MB in the beginning and 929.5 MB in the end (delta: 29.7 MB). Peak memory consumption was 375.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:18,405 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:37:18,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.69 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:18,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.33 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:18,405 INFO L168 Benchmark]: Boogie Preprocessor took 15.61 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:37:18,406 INFO L168 Benchmark]: RCFGBuilder took 193.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:18,406 INFO L168 Benchmark]: TraceAbstraction took 3431.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 937.5 MB in the end (delta: 199.8 MB). Peak memory consumption was 388.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:18,406 INFO L168 Benchmark]: Witness Printer took 39.85 ms. Allocated memory is still 1.4 GB. Free memory was 937.5 MB in the beginning and 929.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:18,408 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.69 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.33 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.61 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 193.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3431.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 937.5 MB in the end (delta: 199.8 MB). Peak memory consumption was 388.6 MB. Max. memory is 11.5 GB. * Witness Printer took 39.85 ms. Allocated memory is still 1.4 GB. Free memory was 937.5 MB in the beginning and 929.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 5]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 13]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 7 error locations. SAFE Result, 3.3s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 219 SDtfs, 276 SDslu, 356 SDs, 0 SdLazy, 258 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 468 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 57 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 457 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 633 ConstructedInterpolants, 4 QuantifiedInterpolants, 93318 SizeOfPredicates, 31 NumberOfNonLiveVariables, 726 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 26 InterpolantComputations, 11 PerfectInterpolantSequences, 242/575 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...