./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/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 6808c66573fa9f309265139cf6a41427fc3491cf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 01:52:56,085 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:52:56,086 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:52:56,092 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:52:56,092 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:52:56,093 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:52:56,093 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:52:56,094 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:52:56,095 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:52:56,095 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:52:56,096 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:52:56,096 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:52:56,096 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:52:56,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:52:56,097 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:52:56,097 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:52:56,098 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:52:56,099 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:52:56,099 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:52:56,100 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:52:56,101 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:52:56,101 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:52:56,102 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:52:56,103 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:52:56,103 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:52:56,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:52:56,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:52:56,104 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:52:56,104 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:52:56,105 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:52:56,105 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:52:56,105 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:52:56,106 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:52:56,106 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:52:56,106 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:52:56,106 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:52:56,107 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 01:52:56,114 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:52:56,114 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:52:56,114 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:52:56,114 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 01:52:56,114 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 01:52:56,115 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 01:52:56,115 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 01:52:56,115 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 01:52:56,115 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 01:52:56,115 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 01:52:56,115 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 01:52:56,115 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 01:52:56,115 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 01:52:56,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 01:52:56,116 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 01:52:56,116 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:52:56,116 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:52:56,116 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 01:52:56,116 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:52:56,116 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:52:56,116 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:52:56,116 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 01:52:56,116 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 01:52:56,116 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 01:52:56,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:52:56,117 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:52:56,117 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:52:56,117 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:52:56,117 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:52:56,117 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 01:52:56,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:52:56,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:52:56,117 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:52:56,117 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 01:52:56,117 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:52:56,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:52:56,118 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_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/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 -> 6808c66573fa9f309265139cf6a41427fc3491cf [2018-12-03 01:52:56,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:52:56,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:52:56,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:52:56,148 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:52:56,148 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:52:56,148 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/bin-2019/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i [2018-12-03 01:52:56,187 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/bin-2019/utaipan/data/f2d87204d/9d14436594ab435283c5a4cc7d6629d0/FLAG07e8d7a18 [2018-12-03 01:52:56,629 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:52:56,629 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/sv-benchmarks/c/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i [2018-12-03 01:52:56,635 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/bin-2019/utaipan/data/f2d87204d/9d14436594ab435283c5a4cc7d6629d0/FLAG07e8d7a18 [2018-12-03 01:52:56,643 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/bin-2019/utaipan/data/f2d87204d/9d14436594ab435283c5a4cc7d6629d0 [2018-12-03 01:52:56,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:52:56,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:52:56,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:52:56,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:52:56,649 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:52:56,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:52:56" (1/1) ... [2018-12-03 01:52:56,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f79a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:52:56, skipping insertion in model container [2018-12-03 01:52:56,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:52:56" (1/1) ... [2018-12-03 01:52:56,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:52:56,682 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:52:56,818 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:52:56,824 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:52:56,876 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:52:56,897 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:52:56,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:52:56 WrapperNode [2018-12-03 01:52:56,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:52:56,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:52:56,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:52:56,898 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:52:56,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:52:56" (1/1) ... [2018-12-03 01:52:56,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:52:56" (1/1) ... [2018-12-03 01:52:56,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:52:56,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:52:56,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:52:56,916 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:52:56,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:52:56" (1/1) ... [2018-12-03 01:52:56,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:52:56" (1/1) ... [2018-12-03 01:52:56,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:52:56" (1/1) ... [2018-12-03 01:52:56,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:52:56" (1/1) ... [2018-12-03 01:52:56,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:52:56" (1/1) ... [2018-12-03 01:52:56,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:52:56" (1/1) ... [2018-12-03 01:52:56,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:52:56" (1/1) ... [2018-12-03 01:52:56,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:52:56,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:52:56,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:52:56,932 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:52:56,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:52:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:52:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 01:52:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 01:52:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 01:52:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 01:52:56,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 01:52:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 01:52:56,963 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 01:52:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 01:52:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 01:52:56,963 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2018-12-03 01:52:56,964 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-12-03 01:52:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 01:52:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2018-12-03 01:52:56,964 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2018-12-03 01:52:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:52:56,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:52:57,164 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:52:57,164 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 01:52:57,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:52:57 BoogieIcfgContainer [2018-12-03 01:52:57,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:52:57,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 01:52:57,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 01:52:57,168 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 01:52:57,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:52:56" (1/3) ... [2018-12-03 01:52:57,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0aa572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:52:57, skipping insertion in model container [2018-12-03 01:52:57,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:52:56" (2/3) ... [2018-12-03 01:52:57,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0aa572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:52:57, skipping insertion in model container [2018-12-03 01:52:57,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:52:57" (3/3) ... [2018-12-03 01:52:57,170 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_true-valid-memsafety_true-termination.i [2018-12-03 01:52:57,177 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 01:52:57,183 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-12-03 01:52:57,196 INFO L257 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2018-12-03 01:52:57,212 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 01:52:57,212 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 01:52:57,213 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 01:52:57,213 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:52:57,213 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:52:57,213 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 01:52:57,213 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:52:57,213 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 01:52:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-12-03 01:52:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 01:52:57,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:52:57,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:52:57,231 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:52:57,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:52:57,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1994022826, now seen corresponding path program 1 times [2018-12-03 01:52:57,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:52:57,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:57,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:52:57,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:57,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:52:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:52:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:52:57,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:52:57,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:52:57,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:52:57,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:52:57,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:52:57,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:52:57,365 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-12-03 01:52:57,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:52:57,471 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 01:52:57,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:52:57,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-03 01:52:57,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:52:57,478 INFO L225 Difference]: With dead ends: 70 [2018-12-03 01:52:57,478 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 01:52:57,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:52:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 01:52:57,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 01:52:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 01:52:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 01:52:57,501 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 9 [2018-12-03 01:52:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:52:57,501 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 01:52:57,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:52:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 01:52:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 01:52:57,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:52:57,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:52:57,502 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:52:57,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:52:57,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1994022825, now seen corresponding path program 1 times [2018-12-03 01:52:57,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:52:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:57,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:52:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:57,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:52:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:52:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:52:57,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:52:57,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:52:57,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:52:57,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:52:57,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:52:57,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:52:57,559 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 5 states. [2018-12-03 01:52:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:52:57,653 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 01:52:57,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:52:57,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-03 01:52:57,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:52:57,654 INFO L225 Difference]: With dead ends: 64 [2018-12-03 01:52:57,654 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 01:52:57,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:52:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 01:52:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 01:52:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 01:52:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 01:52:57,658 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 9 [2018-12-03 01:52:57,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:52:57,658 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 01:52:57,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:52:57,658 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 01:52:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 01:52:57,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:52:57,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:52:57,658 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:52:57,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:52:57,659 INFO L82 PathProgramCache]: Analyzing trace with hash -700522056, now seen corresponding path program 1 times [2018-12-03 01:52:57,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:52:57,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:57,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:52:57,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:57,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:52:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:52:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:52:57,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:52:57,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:52:57,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:52:57,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:52:57,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:52:57,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:52:57,728 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 7 states. [2018-12-03 01:52:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:52:57,812 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 01:52:57,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:52:57,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 01:52:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:52:57,813 INFO L225 Difference]: With dead ends: 61 [2018-12-03 01:52:57,813 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 01:52:57,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:52:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 01:52:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 01:52:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 01:52:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 01:52:57,816 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 11 [2018-12-03 01:52:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:52:57,816 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 01:52:57,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:52:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 01:52:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 01:52:57,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:52:57,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:52:57,817 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:52:57,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:52:57,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1108168538, now seen corresponding path program 1 times [2018-12-03 01:52:57,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:52:57,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:57,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:52:57,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:57,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:52:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:52:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:52:57,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:52:57,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:52:57,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:52:57,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:52:57,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:52:57,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:52:57,867 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 5 states. [2018-12-03 01:52:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:52:57,944 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 01:52:57,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:52:57,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 01:52:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:52:57,945 INFO L225 Difference]: With dead ends: 60 [2018-12-03 01:52:57,945 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 01:52:57,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:52:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 01:52:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 01:52:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 01:52:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 01:52:57,948 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 13 [2018-12-03 01:52:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:52:57,948 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 01:52:57,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:52:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 01:52:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 01:52:57,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:52:57,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:52:57,949 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:52:57,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:52:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1108168539, now seen corresponding path program 1 times [2018-12-03 01:52:57,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:52:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:57,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:52:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:57,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:52:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:52:58,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:52:58,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:52:58,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:52:58,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:52:58,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:52:58,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:52:58,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:52:58,023 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 6 states. [2018-12-03 01:52:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:52:58,121 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 01:52:58,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:52:58,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-03 01:52:58,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:52:58,122 INFO L225 Difference]: With dead ends: 59 [2018-12-03 01:52:58,122 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 01:52:58,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:52:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 01:52:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 01:52:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 01:52:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 01:52:58,125 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 13 [2018-12-03 01:52:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:52:58,125 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 01:52:58,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:52:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 01:52:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 01:52:58,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:52:58,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:52:58,126 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:52:58,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:52:58,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1964687766, now seen corresponding path program 1 times [2018-12-03 01:52:58,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:52:58,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:58,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:52:58,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:58,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:52:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:52:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:52:58,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:52:58,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 01:52:58,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:52:58,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 01:52:58,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 01:52:58,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:52:58,214 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 11 states. [2018-12-03 01:52:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:52:58,402 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 01:52:58,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 01:52:58,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-03 01:52:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:52:58,403 INFO L225 Difference]: With dead ends: 58 [2018-12-03 01:52:58,403 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 01:52:58,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-03 01:52:58,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 01:52:58,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 01:52:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 01:52:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 01:52:58,407 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 16 [2018-12-03 01:52:58,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:52:58,407 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 01:52:58,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 01:52:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 01:52:58,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 01:52:58,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:52:58,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:52:58,408 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:52:58,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:52:58,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1964687765, now seen corresponding path program 1 times [2018-12-03 01:52:58,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:52:58,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:58,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:52:58,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:58,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:52:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:52:58,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:52:58,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:52:58,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 01:52:58,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:52:58,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 01:52:58,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 01:52:58,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:52:58,537 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 11 states. [2018-12-03 01:52:58,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:52:58,777 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 01:52:58,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 01:52:58,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-03 01:52:58,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:52:58,778 INFO L225 Difference]: With dead ends: 57 [2018-12-03 01:52:58,778 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 01:52:58,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-03 01:52:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 01:52:58,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 01:52:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 01:52:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 01:52:58,780 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 16 [2018-12-03 01:52:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:52:58,780 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 01:52:58,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 01:52:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 01:52:58,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 01:52:58,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:52:58,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:52:58,781 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:52:58,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:52:58,781 INFO L82 PathProgramCache]: Analyzing trace with hash 982495242, now seen corresponding path program 1 times [2018-12-03 01:52:58,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:52:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:58,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:52:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:58,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:52:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:52:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:52:58,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:52:58,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 01:52:58,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:52:58,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:52:58,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:52:58,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:52:58,803 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 3 states. [2018-12-03 01:52:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:52:58,831 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 01:52:58,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:52:58,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-03 01:52:58,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:52:58,832 INFO L225 Difference]: With dead ends: 53 [2018-12-03 01:52:58,832 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 01:52:58,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:52:58,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 01:52:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 01:52:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 01:52:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 01:52:58,834 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 24 [2018-12-03 01:52:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:52:58,834 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 01:52:58,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:52:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 01:52:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 01:52:58,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:52:58,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:52:58,835 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:52:58,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:52:58,835 INFO L82 PathProgramCache]: Analyzing trace with hash 982495243, now seen corresponding path program 1 times [2018-12-03 01:52:58,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:52:58,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:58,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:52:58,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:58,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:52:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:52:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:52:58,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:52:58,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 01:52:58,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:52:58,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:52:58,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:52:58,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:52:58,859 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 3 states. [2018-12-03 01:52:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:52:58,885 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 01:52:58,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:52:58,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-03 01:52:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:52:58,886 INFO L225 Difference]: With dead ends: 49 [2018-12-03 01:52:58,886 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 01:52:58,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:52:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 01:52:58,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 01:52:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 01:52:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 01:52:58,888 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 24 [2018-12-03 01:52:58,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:52:58,888 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 01:52:58,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:52:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 01:52:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 01:52:58,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:52:58,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:52:58,889 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:52:58,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:52:58,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1172754959, now seen corresponding path program 1 times [2018-12-03 01:52:58,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:52:58,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:58,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:52:58,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:58,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:52:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:52:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:52:59,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:52:59,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-03 01:52:59,157 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:52:59,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:52:59,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:52:59,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:52:59,158 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 19 states. [2018-12-03 01:52:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:52:59,622 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 01:52:59,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 01:52:59,622 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-12-03 01:52:59,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:52:59,623 INFO L225 Difference]: With dead ends: 47 [2018-12-03 01:52:59,623 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 01:52:59,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2018-12-03 01:52:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 01:52:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 01:52:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 01:52:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 01:52:59,625 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 30 [2018-12-03 01:52:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:52:59,625 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 01:52:59,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:52:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 01:52:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 01:52:59,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:52:59,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:52:59,626 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:52:59,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:52:59,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1172754960, now seen corresponding path program 1 times [2018-12-03 01:52:59,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:52:59,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:59,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:52:59,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:52:59,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:52:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:52:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:52:59,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:52:59,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-03 01:52:59,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:52:59,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:52:59,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:52:59,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:52:59,948 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 19 states. [2018-12-03 01:53:00,390 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-12-03 01:53:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:53:00,954 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 01:53:00,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 01:53:00,954 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-12-03 01:53:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:53:00,955 INFO L225 Difference]: With dead ends: 45 [2018-12-03 01:53:00,955 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 01:53:00,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 01:53:00,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 01:53:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 01:53:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 01:53:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 01:53:00,957 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 30 [2018-12-03 01:53:00,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:53:00,958 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 01:53:00,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:53:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 01:53:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 01:53:00,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:53:00,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:53:00,959 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:53:00,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:53:00,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1995665389, now seen corresponding path program 1 times [2018-12-03 01:53:00,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:53:00,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:53:00,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:53:00,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:53:00,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:53:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:53:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:53:01,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:53:01,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-03 01:53:01,269 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:53:01,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 01:53:01,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 01:53:01,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-12-03 01:53:01,270 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 21 states. [2018-12-03 01:53:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:53:01,766 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 01:53:01,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 01:53:01,766 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2018-12-03 01:53:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:53:01,766 INFO L225 Difference]: With dead ends: 44 [2018-12-03 01:53:01,766 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 01:53:01,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 01:53:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 01:53:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 01:53:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 01:53:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 01:53:01,768 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 31 [2018-12-03 01:53:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:53:01,768 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 01:53:01,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 01:53:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 01:53:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 01:53:01,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:53:01,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:53:01,769 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:53:01,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:53:01,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1995665390, now seen corresponding path program 1 times [2018-12-03 01:53:01,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:53:01,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:53:01,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:53:01,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:53:01,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:53:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:53:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:53:02,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:53:02,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-03 01:53:02,108 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:53:02,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:53:02,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:53:02,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:53:02,108 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 19 states. [2018-12-03 01:53:02,489 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-12-03 01:53:02,690 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2018-12-03 01:53:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:53:03,239 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 01:53:03,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 01:53:03,240 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2018-12-03 01:53:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:53:03,240 INFO L225 Difference]: With dead ends: 42 [2018-12-03 01:53:03,240 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 01:53:03,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=1117, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 01:53:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 01:53:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 01:53:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 01:53:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 01:53:03,242 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-12-03 01:53:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:53:03,242 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 01:53:03,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:53:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 01:53:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 01:53:03,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:53:03,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:53:03,243 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:53:03,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:53:03,244 INFO L82 PathProgramCache]: Analyzing trace with hash -382301097, now seen corresponding path program 1 times [2018-12-03 01:53:03,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:53:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:53:03,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:53:03,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:53:03,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:53:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:53:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:53:03,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:53:03,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-12-03 01:53:03,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:53:03,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 01:53:03,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 01:53:03,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2018-12-03 01:53:03,664 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 24 states. [2018-12-03 01:53:04,110 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-03 01:53:04,318 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2018-12-03 01:53:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:53:04,805 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 01:53:04,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 01:53:04,806 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2018-12-03 01:53:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:53:04,806 INFO L225 Difference]: With dead ends: 41 [2018-12-03 01:53:04,806 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 01:53:04,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=188, Invalid=1534, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 01:53:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 01:53:04,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 01:53:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 01:53:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 01:53:04,809 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-12-03 01:53:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:53:04,809 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 01:53:04,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 01:53:04,809 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 01:53:04,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 01:53:04,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:53:04,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:53:04,810 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:53:04,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:53:04,810 INFO L82 PathProgramCache]: Analyzing trace with hash -383005379, now seen corresponding path program 1 times [2018-12-03 01:53:04,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:53:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:53:04,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:53:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:53:04,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:53:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:53:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:53:05,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:53:05,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-12-03 01:53:05,696 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:53:05,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 01:53:05,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 01:53:05,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-12-03 01:53:05,696 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 26 states. [2018-12-03 01:53:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:53:07,535 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2018-12-03 01:53:07,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 01:53:07,536 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2018-12-03 01:53:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:53:07,537 INFO L225 Difference]: With dead ends: 43 [2018-12-03 01:53:07,537 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 01:53:07,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 01:53:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 01:53:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 01:53:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 01:53:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 40 transitions. [2018-12-03 01:53:07,542 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 40 transitions. Word has length 36 [2018-12-03 01:53:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:53:07,542 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 40 transitions. [2018-12-03 01:53:07,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 01:53:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2018-12-03 01:53:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 01:53:07,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:53:07,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:53:07,545 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION]=== [2018-12-03 01:53:07,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:53:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash 403374402, now seen corresponding path program 1 times [2018-12-03 01:53:07,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:53:07,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:53:07,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:53:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:53:07,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:53:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:53:09,399 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2018-12-03 01:53:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:53:09,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:53:09,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-12-03 01:53:09,839 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:53:09,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 01:53:09,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 01:53:09,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2018-12-03 01:53:09,839 INFO L87 Difference]: Start difference. First operand 41 states and 40 transitions. Second operand 25 states. [2018-12-03 01:53:10,326 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2018-12-03 01:53:10,587 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-12-03 01:53:10,874 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-12-03 01:53:11,215 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2018-12-03 01:53:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:53:11,983 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2018-12-03 01:53:11,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 01:53:11,983 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2018-12-03 01:53:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:53:11,983 INFO L225 Difference]: With dead ends: 40 [2018-12-03 01:53:11,983 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 01:53:11,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 01:53:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 01:53:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 01:53:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 01:53:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 01:53:11,984 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-12-03 01:53:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:53:11,984 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 01:53:11,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 01:53:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 01:53:11,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 01:53:11,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:53:11 BoogieIcfgContainer [2018-12-03 01:53:11,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 01:53:11,987 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:53:11,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:53:11,987 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:53:11,988 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:52:57" (3/4) ... [2018-12-03 01:53:11,990 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 01:53:11,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 01:53:11,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 01:53:11,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_data [2018-12-03 01:53:11,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_data [2018-12-03 01:53:11,997 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-03 01:53:11,997 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-03 01:53:11,997 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 01:53:12,023 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6241f7a2-5a65-40cb-8ea9-7d0d3c192d70/bin-2019/utaipan/witness.graphml [2018-12-03 01:53:12,023 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:53:12,024 INFO L168 Benchmark]: Toolchain (without parser) took 15378.64 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.3 MB). Free memory was 948.1 MB in the beginning and 1.3 GB in the end (delta: -366.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2018-12-03 01:53:12,024 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:53:12,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-03 01:53:12,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-03 01:53:12,025 INFO L168 Benchmark]: Boogie Preprocessor took 15.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:53:12,025 INFO L168 Benchmark]: RCFGBuilder took 232.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2018-12-03 01:53:12,025 INFO L168 Benchmark]: TraceAbstraction took 14821.93 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 286.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -284.6 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2018-12-03 01:53:12,025 INFO L168 Benchmark]: Witness Printer took 35.93 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2018-12-03 01:53:12,027 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 232.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14821.93 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 286.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -284.6 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Witness Printer took 35.93 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 639]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 636]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 637]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 636]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 33 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 33 error locations. SAFE Result, 14.7s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 530 SDtfs, 516 SDslu, 2145 SDs, 0 SdLazy, 4733 SolverSat, 254 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 353 ConstructedInterpolants, 0 QuantifiedInterpolants, 204573 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...