./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/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 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:57:43,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:57:43,305 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:57:43,314 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:57:43,314 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:57:43,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:57:43,315 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:57:43,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:57:43,318 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:57:43,318 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:57:43,319 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:57:43,319 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:57:43,320 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:57:43,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:57:43,321 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:57:43,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:57:43,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:57:43,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:57:43,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:57:43,326 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:57:43,327 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:57:43,327 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:57:43,329 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:57:43,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:57:43,329 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:57:43,330 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:57:43,331 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:57:43,331 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:57:43,332 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:57:43,333 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:57:43,333 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:57:43,333 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:57:43,333 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:57:43,333 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:57:43,334 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:57:43,334 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:57:43,335 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-18 17:57:43,345 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:57:43,345 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:57:43,346 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:57:43,346 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:57:43,346 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:57:43,346 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:57:43,346 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:57:43,346 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:57:43,347 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:57:43,347 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:57:43,347 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:57:43,347 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:57:43,347 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:57:43,348 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 17:57:43,348 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 17:57:43,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:57:43,348 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:57:43,348 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 17:57:43,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:57:43,348 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:57:43,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:57:43,349 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 17:57:43,349 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 17:57:43,349 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-18 17:57:43,349 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:57:43,349 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:57:43,349 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:57:43,350 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:57:43,350 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:57:43,350 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:57:43,350 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:57:43,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:57:43,350 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:57:43,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:57:43,350 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:57:43,351 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:57:43,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:57:43,351 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_5f72dec8-93df-43e9-b100-061519c7c1d2/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 -> 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 [2018-11-18 17:57:43,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:57:43,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:57:43,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:57:43,383 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:57:43,383 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:57:43,383 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c [2018-11-18 17:57:43,418 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/data/173d44e8f/cce74b12eb3d42548857a12916a3ebd1/FLAG4021e1366 [2018-11-18 17:57:43,810 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:57:43,810 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c [2018-11-18 17:57:43,814 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/data/173d44e8f/cce74b12eb3d42548857a12916a3ebd1/FLAG4021e1366 [2018-11-18 17:57:43,823 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/data/173d44e8f/cce74b12eb3d42548857a12916a3ebd1 [2018-11-18 17:57:43,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:57:43,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:57:43,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:57:43,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:57:43,829 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:57:43,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:57:43" (1/1) ... [2018-11-18 17:57:43,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6180e9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:57:43, skipping insertion in model container [2018-11-18 17:57:43,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:57:43" (1/1) ... [2018-11-18 17:57:43,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:57:43,850 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:57:43,957 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:57:43,962 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:57:43,971 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:57:43,982 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:57:43,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:57:43 WrapperNode [2018-11-18 17:57:43,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:57:43,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:57:43,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:57:43,983 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:57:43,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:57:43" (1/1) ... [2018-11-18 17:57:43,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:57:43" (1/1) ... [2018-11-18 17:57:43,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:57:43,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:57:43,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:57:43,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:57:44,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:57:43" (1/1) ... [2018-11-18 17:57:44,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:57:43" (1/1) ... [2018-11-18 17:57:44,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:57:43" (1/1) ... [2018-11-18 17:57:44,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:57:43" (1/1) ... [2018-11-18 17:57:44,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:57:43" (1/1) ... [2018-11-18 17:57:44,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:57:43" (1/1) ... [2018-11-18 17:57:44,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:57:43" (1/1) ... [2018-11-18 17:57:44,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:57:44,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:57:44,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:57:44,013 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:57:44,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:57:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:57:44,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 17:57:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:57:44,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:57:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:57:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:57:44,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:57:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 17:57:44,083 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:57:44,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:57:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 17:57:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 17:57:44,187 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:57:44,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:57:44 BoogieIcfgContainer [2018-11-18 17:57:44,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:57:44,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:57:44,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:57:44,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:57:44,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:57:43" (1/3) ... [2018-11-18 17:57:44,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac5545a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:57:44, skipping insertion in model container [2018-11-18 17:57:44,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:57:43" (2/3) ... [2018-11-18 17:57:44,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac5545a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:57:44, skipping insertion in model container [2018-11-18 17:57:44,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:57:44" (3/3) ... [2018-11-18 17:57:44,191 INFO L112 eAbstractionObserver]: Analyzing ICFG realloc1_false-valid-deref.c [2018-11-18 17:57:44,197 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:57:44,201 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-18 17:57:44,209 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-18 17:57:44,224 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:57:44,224 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 17:57:44,224 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:57:44,224 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:57:44,224 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:57:44,224 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:57:44,224 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:57:44,224 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:57:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-18 17:57:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-18 17:57:44,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:44,240 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:44,241 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:44,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:44,245 INFO L82 PathProgramCache]: Analyzing trace with hash -746767554, now seen corresponding path program 1 times [2018-11-18 17:57:44,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:44,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:57:44,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:44,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:57:44,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 17:57:44,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:57:44,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 17:57:44,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 17:57:44,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 17:57:44,324 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-18 17:57:44,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:44,334 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-18 17:57:44,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 17:57:44,335 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-18 17:57:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:44,340 INFO L225 Difference]: With dead ends: 27 [2018-11-18 17:57:44,340 INFO L226 Difference]: Without dead ends: 24 [2018-11-18 17:57:44,342 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 17:57:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-18 17:57:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-18 17:57:44,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 17:57:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-18 17:57:44,367 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2018-11-18 17:57:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:44,367 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-18 17:57:44,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 17:57:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-18 17:57:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 17:57:44,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:44,368 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:44,368 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:44,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:44,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1674970535, now seen corresponding path program 1 times [2018-11-18 17:57:44,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:44,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:57:44,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:44,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:57:44,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:57:44,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:57:44,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:57:44,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:57:44,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:57:44,404 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-11-18 17:57:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:44,424 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-18 17:57:44,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:57:44,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-18 17:57:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:44,425 INFO L225 Difference]: With dead ends: 31 [2018-11-18 17:57:44,426 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 17:57:44,426 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:57:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 17:57:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-11-18 17:57:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 17:57:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-18 17:57:44,430 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 9 [2018-11-18 17:57:44,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:44,430 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-18 17:57:44,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:57:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-18 17:57:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 17:57:44,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:44,431 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:44,431 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:44,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1674970481, now seen corresponding path program 1 times [2018-11-18 17:57:44,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:44,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:57:44,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:44,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:57:44,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 17:57:44,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:57:44,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:57:44,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:57:44,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:57:44,463 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 3 states. [2018-11-18 17:57:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:44,484 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-18 17:57:44,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:57:44,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-18 17:57:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:44,486 INFO L225 Difference]: With dead ends: 27 [2018-11-18 17:57:44,486 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 17:57:44,486 INFO L604 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-11-18 17:57:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 17:57:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-11-18 17:57:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 17:57:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-18 17:57:44,489 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 9 [2018-11-18 17:57:44,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:44,489 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-18 17:57:44,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:57:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-18 17:57:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 17:57:44,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:44,490 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:44,490 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:44,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:44,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1674970480, now seen corresponding path program 1 times [2018-11-18 17:57:44,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:44,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:57:44,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:44,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:57:44,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 17:57:44,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:57:44,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:57:44,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:57:44,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:57:44,544 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-11-18 17:57:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:44,578 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-18 17:57:44,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:57:44,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-18 17:57:44,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:44,579 INFO L225 Difference]: With dead ends: 27 [2018-11-18 17:57:44,579 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 17:57:44,579 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:57:44,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 17:57:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-18 17:57:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 17:57:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-18 17:57:44,581 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 9 [2018-11-18 17:57:44,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:44,581 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-18 17:57:44,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:57:44,581 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-18 17:57:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 17:57:44,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:44,582 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:44,582 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:44,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:44,582 INFO L82 PathProgramCache]: Analyzing trace with hash 609832965, now seen corresponding path program 1 times [2018-11-18 17:57:44,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:44,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:57:44,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:57:44,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:57:44,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 17:57:44,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:57:44,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:57:44,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:57:44,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:57:44,617 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 3 states. [2018-11-18 17:57:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:44,631 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-18 17:57:44,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:57:44,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-18 17:57:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:44,632 INFO L225 Difference]: With dead ends: 27 [2018-11-18 17:57:44,632 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 17:57:44,633 INFO L604 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-11-18 17:57:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 17:57:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-11-18 17:57:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 17:57:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-18 17:57:44,635 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2018-11-18 17:57:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:44,636 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-18 17:57:44,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:57:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-18 17:57:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 17:57:44,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:44,636 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:44,637 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:44,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash 609833020, now seen corresponding path program 1 times [2018-11-18 17:57:44,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:57:44,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:44,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:57:44,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:57:44,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:57:44,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:57:44,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:57:44,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:57:44,730 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2018-11-18 17:57:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:44,750 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-18 17:57:44,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:57:44,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-18 17:57:44,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:44,751 INFO L225 Difference]: With dead ends: 27 [2018-11-18 17:57:44,751 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 17:57:44,751 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:57:44,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 17:57:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-11-18 17:57:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 17:57:44,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-18 17:57:44,753 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-11-18 17:57:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:44,754 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-18 17:57:44,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:57:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-18 17:57:44,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 17:57:44,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:44,754 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:44,755 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:44,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:44,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1933928936, now seen corresponding path program 1 times [2018-11-18 17:57:44,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:44,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:57:44,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:44,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:44,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:44,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:57:44,794 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-11-18 17:57:44,795 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [15], [18], [20], [25], [27], [29], [40], [41], [42] [2018-11-18 17:57:44,813 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:57:44,813 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:57:44,919 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:57:44,920 INFO L272 AbstractInterpreter]: Visited 15 different actions 33 times. Merged at 5 different actions 15 times. Never widened. Performed 155 root evaluator evaluations with a maximum evaluation depth of 3. Performed 155 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-11-18 17:57:44,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:44,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:57:44,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:44,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:57:44,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:57:44,935 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:57:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:44,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:57:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:44,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:57:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:57:45,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-18 17:57:45,008 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:57:45,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:57:45,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:57:45,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:57:45,009 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-18 17:57:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:45,027 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-18 17:57:45,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:57:45,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-18 17:57:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:45,027 INFO L225 Difference]: With dead ends: 29 [2018-11-18 17:57:45,027 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 17:57:45,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:57:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 17:57:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-11-18 17:57:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 17:57:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-18 17:57:45,029 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 16 [2018-11-18 17:57:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:45,029 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-18 17:57:45,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:57:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-18 17:57:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 17:57:45,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:45,030 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:45,030 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:45,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:45,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1218012484, now seen corresponding path program 2 times [2018-11-18 17:57:45,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:45,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:45,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:57:45,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:45,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:45,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:57:45,056 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 17:57:45,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 17:57:45,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:45,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:57:45,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 17:57:45,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 17:57:45,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 17:57:45,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:57:45,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:57:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:57:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:57:45,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-18 17:57:45,142 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:57:45,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:57:45,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:57:45,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:57:45,143 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 6 states. [2018-11-18 17:57:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:45,157 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-18 17:57:45,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:57:45,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-18 17:57:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:45,158 INFO L225 Difference]: With dead ends: 34 [2018-11-18 17:57:45,158 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 17:57:45,159 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:57:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 17:57:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-18 17:57:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 17:57:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-18 17:57:45,161 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2018-11-18 17:57:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:45,161 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-18 17:57:45,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:57:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-18 17:57:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 17:57:45,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:45,162 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:45,162 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:45,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:45,162 INFO L82 PathProgramCache]: Analyzing trace with hash 843501160, now seen corresponding path program 3 times [2018-11-18 17:57:45,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:45,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:45,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:57:45,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:45,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:45,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:57:45,225 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 17:57:45,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 17:57:45,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:45,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:57:45,233 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 17:57:45,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 17:57:45,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 17:57:45,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:57:45,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:57:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:57:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:57:45,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-18 17:57:45,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:57:45,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 17:57:45,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:57:45,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 17:57:45,333 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 7 states. [2018-11-18 17:57:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:45,352 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-18 17:57:45,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:57:45,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-18 17:57:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:45,355 INFO L225 Difference]: With dead ends: 39 [2018-11-18 17:57:45,355 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 17:57:45,355 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 17:57:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 17:57:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-18 17:57:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 17:57:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-18 17:57:45,358 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 26 [2018-11-18 17:57:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:45,358 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-18 17:57:45,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 17:57:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-18 17:57:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 17:57:45,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:45,359 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:45,359 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:45,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1341127108, now seen corresponding path program 4 times [2018-11-18 17:57:45,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:45,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:57:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:45,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:45,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:57:45,404 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 17:57:45,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 17:57:45,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:45,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:57:45,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:57:45,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:57:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:45,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:57:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:57:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:57:45,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-18 17:57:45,521 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:57:45,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 17:57:45,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 17:57:45,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:57:45,522 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 8 states. [2018-11-18 17:57:45,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:45,545 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-18 17:57:45,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 17:57:45,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-18 17:57:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:45,547 INFO L225 Difference]: With dead ends: 44 [2018-11-18 17:57:45,547 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 17:57:45,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:57:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 17:57:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-18 17:57:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 17:57:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-18 17:57:45,552 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 31 [2018-11-18 17:57:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:45,552 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-18 17:57:45,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 17:57:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-18 17:57:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 17:57:45,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:45,553 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:45,553 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:45,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:45,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1405840664, now seen corresponding path program 5 times [2018-11-18 17:57:45,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:45,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:45,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:57:45,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:45,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:45,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:57:45,628 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 17:57:45,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 17:57:45,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:45,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:57:45,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 17:57:45,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 17:57:45,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-18 17:57:45,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:57:45,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:57:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:57:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:57:45,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-18 17:57:45,739 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:57:45,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 17:57:45,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 17:57:45,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:57:45,740 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 9 states. [2018-11-18 17:57:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:45,760 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-18 17:57:45,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:57:45,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-18 17:57:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:45,762 INFO L225 Difference]: With dead ends: 49 [2018-11-18 17:57:45,762 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 17:57:45,762 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:57:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 17:57:45,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-18 17:57:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 17:57:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-18 17:57:45,764 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 36 [2018-11-18 17:57:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:45,765 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-18 17:57:45,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 17:57:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-18 17:57:45,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 17:57:45,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:45,766 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:45,766 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:45,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:45,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1299639876, now seen corresponding path program 6 times [2018-11-18 17:57:45,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:45,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:45,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:57:45,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:45,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:45,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:57:45,821 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 17:57:45,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 17:57:45,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:45,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:57:45,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 17:57:45,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 17:57:45,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 17:57:45,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:57:45,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:57:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:57:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:45,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:57:45,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-11-18 17:57:45,925 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:57:45,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 17:57:45,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 17:57:45,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:57:45,926 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 10 states. [2018-11-18 17:57:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:45,989 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-18 17:57:45,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 17:57:45,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-18 17:57:45,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:45,990 INFO L225 Difference]: With dead ends: 54 [2018-11-18 17:57:45,990 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 17:57:45,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:57:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 17:57:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-11-18 17:57:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 17:57:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-18 17:57:45,993 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 41 [2018-11-18 17:57:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:45,993 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-18 17:57:45,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 17:57:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-18 17:57:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 17:57:46,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:46,000 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:46,000 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:46,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash -317278360, now seen corresponding path program 7 times [2018-11-18 17:57:46,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:46,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:46,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:57:46,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:46,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:46,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:46,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:57:46,053 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 17:57:46,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 17:57:46,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:46,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:57:46,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:57:46,060 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:57:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:46,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:57:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:46,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:57:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:46,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:57:46,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-11-18 17:57:46,161 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:57:46,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 17:57:46,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 17:57:46,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:57:46,161 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 11 states. [2018-11-18 17:57:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:46,184 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-18 17:57:46,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 17:57:46,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-11-18 17:57:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:46,186 INFO L225 Difference]: With dead ends: 59 [2018-11-18 17:57:46,186 INFO L226 Difference]: Without dead ends: 59 [2018-11-18 17:57:46,186 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:57:46,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-18 17:57:46,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-11-18 17:57:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 17:57:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-18 17:57:46,188 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 46 [2018-11-18 17:57:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:46,188 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-18 17:57:46,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 17:57:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-18 17:57:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 17:57:46,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:46,189 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:46,189 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:46,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:46,190 INFO L82 PathProgramCache]: Analyzing trace with hash -137773764, now seen corresponding path program 8 times [2018-11-18 17:57:46,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:46,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:46,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:57:46,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:46,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:46,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:46,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:57:46,258 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 17:57:46,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 17:57:46,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:46,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:57:46,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 17:57:46,267 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 17:57:46,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-18 17:57:46,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:57:46,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:57:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:46,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:57:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:46,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:57:46,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-11-18 17:57:46,395 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:57:46,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 17:57:46,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 17:57:46,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:57:46,395 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 12 states. [2018-11-18 17:57:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:46,423 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-18 17:57:46,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 17:57:46,423 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-18 17:57:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:46,424 INFO L225 Difference]: With dead ends: 64 [2018-11-18 17:57:46,424 INFO L226 Difference]: Without dead ends: 64 [2018-11-18 17:57:46,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:57:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-18 17:57:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-11-18 17:57:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 17:57:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-11-18 17:57:46,426 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 51 [2018-11-18 17:57:46,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:46,426 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-18 17:57:46,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 17:57:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-18 17:57:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 17:57:46,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:46,427 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:46,427 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:46,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:46,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1762313240, now seen corresponding path program 9 times [2018-11-18 17:57:46,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:46,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:46,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:57:46,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:46,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:57:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:46,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:46,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:57:46,523 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 17:57:46,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 17:57:46,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:57:46,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:57:46,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 17:57:46,531 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 17:57:46,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 17:57:46,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:57:46,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:57:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:46,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:57:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:57:46,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:57:46,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-11-18 17:57:46,688 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:57:46,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 17:57:46,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 17:57:46,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:57:46,689 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 13 states. [2018-11-18 17:57:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:57:46,724 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-11-18 17:57:46,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 17:57:46,725 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-11-18 17:57:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:57:46,725 INFO L225 Difference]: With dead ends: 66 [2018-11-18 17:57:46,725 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 17:57:46,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 102 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:57:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 17:57:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-18 17:57:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-18 17:57:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-11-18 17:57:46,730 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 56 [2018-11-18 17:57:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:57:46,730 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-11-18 17:57:46,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 17:57:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-18 17:57:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 17:57:46,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:57:46,731 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:57:46,731 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-18 17:57:46,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:57:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash -490075972, now seen corresponding path program 10 times [2018-11-18 17:57:46,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:57:46,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:46,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:57:46,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:57:46,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:57:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:57:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:57:46,778 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 17:57:46,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:57:46 BoogieIcfgContainer [2018-11-18 17:57:46,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:57:46,808 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:57:46,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:57:46,809 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:57:46,809 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:57:44" (3/4) ... [2018-11-18 17:57:46,811 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 17:57:46,844 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5f72dec8-93df-43e9-b100-061519c7c1d2/bin-2019/utaipan/witness.graphml [2018-11-18 17:57:46,844 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:57:46,844 INFO L168 Benchmark]: Toolchain (without parser) took 3018.80 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.6 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -94.6 MB). Peak memory consumption was 135.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:57:46,845 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:57:46,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.54 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:57:46,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.56 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:57:46,846 INFO L168 Benchmark]: Boogie Preprocessor took 16.20 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:57:46,846 INFO L168 Benchmark]: RCFGBuilder took 174.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -203.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:57:46,847 INFO L168 Benchmark]: TraceAbstraction took 2620.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 95.2 MB). Peak memory consumption was 156.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:57:46,847 INFO L168 Benchmark]: Witness Printer took 35.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:57:46,850 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.54 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.56 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.20 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 174.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -203.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2620.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 95.2 MB). Peak memory consumption was 156.6 MB. Max. memory is 11.5 GB. * Witness Printer took 35.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L8] EXPR, FCALL malloc(10 * sizeof(int)) [L8] char* p = malloc(10 * sizeof(int)); [L10] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] FCALL p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i < 10) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) [L14] FCALL free(p) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L16] FCALL p[2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 7 error locations. UNSAFE Result, 2.5s OverallTime, 16 OverallIterations, 11 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 278 SDtfs, 221 SDslu, 780 SDs, 0 SdLazy, 308 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 728 GetRequests, 602 SyntacticMatches, 31 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 43 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 772 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1002 ConstructedInterpolants, 0 QuantifiedInterpolants, 99980 SizeOfPredicates, 9 NumberOfNonLiveVariables, 963 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 5/2075 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...