./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/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 440325a953e10d2173456ab8f8c8fc1313a6b958 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-10-27 04:46:56,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:46:56,670 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:46:56,681 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:46:56,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:46:56,683 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:46:56,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:46:56,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:46:56,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:46:56,689 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:46:56,690 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:46:56,690 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:46:56,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:46:56,692 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:46:56,693 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:46:56,693 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:46:56,694 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:46:56,696 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:46:56,697 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:46:56,698 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:46:56,699 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:46:56,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:46:56,701 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:46:56,702 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:46:56,702 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:46:56,703 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:46:56,704 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:46:56,704 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:46:56,705 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:46:56,706 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:46:56,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:46:56,706 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:46:56,707 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:46:56,707 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:46:56,708 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:46:56,709 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:46:56,709 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-10-27 04:46:56,720 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:46:56,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:46:56,721 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 04:46:56,721 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 04:46:56,721 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 04:46:56,721 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 04:46:56,721 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 04:46:56,722 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 04:46:56,722 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 04:46:56,722 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 04:46:56,722 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 04:46:56,722 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:46:56,723 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:46:56,723 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:46:56,723 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:46:56,724 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:46:56,725 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:46:56,725 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:46:56,725 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:46:56,725 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:46:56,725 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:46:56,725 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:46:56,725 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:46:56,725 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:46:56,726 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:46:56,726 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:46:56,726 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:46:56,726 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:46:56,726 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:46:56,726 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:46:56,726 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:46:56,727 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 04:46:56,727 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:46:56,727 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 04:46:56,727 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_f4c22876-bb72-49b5-803b-992b9d135553/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 -> 440325a953e10d2173456ab8f8c8fc1313a6b958 [2018-10-27 04:46:56,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:46:56,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:46:56,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:46:56,783 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:46:56,783 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:46:56,784 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2018-10-27 04:46:56,832 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/data/721f33a72/e6382d64bb264ac182cf5acc03f84809/FLAGf0773d91a [2018-10-27 04:46:57,197 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:46:57,198 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2018-10-27 04:46:57,204 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/data/721f33a72/e6382d64bb264ac182cf5acc03f84809/FLAGf0773d91a [2018-10-27 04:46:57,214 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/data/721f33a72/e6382d64bb264ac182cf5acc03f84809 [2018-10-27 04:46:57,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:46:57,218 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 04:46:57,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:46:57,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:46:57,222 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:46:57,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:46:57" (1/1) ... [2018-10-27 04:46:57,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378ff548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:57, skipping insertion in model container [2018-10-27 04:46:57,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:46:57" (1/1) ... [2018-10-27 04:46:57,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:46:57,249 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:46:57,373 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:46:57,385 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:46:57,403 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:46:57,419 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:46:57,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:57 WrapperNode [2018-10-27 04:46:57,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:46:57,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 04:46:57,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 04:46:57,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 04:46:57,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:57" (1/1) ... [2018-10-27 04:46:57,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:57" (1/1) ... [2018-10-27 04:46:57,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 04:46:57,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:46:57,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:46:57,467 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:46:57,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:57" (1/1) ... [2018-10-27 04:46:57,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:57" (1/1) ... [2018-10-27 04:46:57,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:57" (1/1) ... [2018-10-27 04:46:57,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:57" (1/1) ... [2018-10-27 04:46:57,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:57" (1/1) ... [2018-10-27 04:46:57,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:57" (1/1) ... [2018-10-27 04:46:57,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:57" (1/1) ... [2018-10-27 04:46:57,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:46:57,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:46:57,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:46:57,532 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:46:57,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/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-10-27 04:46:57,695 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-10-27 04:46:57,695 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-10-27 04:46:57,695 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:46:57,695 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:46:57,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:46:57,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:46:57,695 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-10-27 04:46:57,695 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-10-27 04:46:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-10-27 04:46:57,696 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-10-27 04:46:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:46:57,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:46:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-10-27 04:46:57,696 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-10-27 04:46:58,592 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:46:58,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:46:58 BoogieIcfgContainer [2018-10-27 04:46:58,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:46:58,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:46:58,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:46:58,596 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:46:58,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:46:57" (1/3) ... [2018-10-27 04:46:58,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb04af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:46:58, skipping insertion in model container [2018-10-27 04:46:58,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:46:57" (2/3) ... [2018-10-27 04:46:58,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb04af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:46:58, skipping insertion in model container [2018-10-27 04:46:58,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:46:58" (3/3) ... [2018-10-27 04:46:58,598 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_false-valid-deref.c [2018-10-27 04:46:58,607 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:46:58,617 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-10-27 04:46:58,633 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-10-27 04:46:58,659 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:46:58,659 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:46:58,660 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:46:58,660 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:46:58,660 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:46:58,660 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:46:58,660 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:46:58,660 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:46:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-10-27 04:46:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-27 04:46:58,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:58,688 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:58,690 INFO L424 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:58,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:58,696 INFO L82 PathProgramCache]: Analyzing trace with hash -122610617, now seen corresponding path program 1 times [2018-10-27 04:46:58,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:58,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:58,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:58,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:58,742 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:58,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:58,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:58,938 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:58,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:46:58,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:46:58,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:46:58,954 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2018-10-27 04:46:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:59,290 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-10-27 04:46:59,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:46:59,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-27 04:46:59,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:59,300 INFO L225 Difference]: With dead ends: 83 [2018-10-27 04:46:59,301 INFO L226 Difference]: Without dead ends: 80 [2018-10-27 04:46:59,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:59,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-27 04:46:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-10-27 04:46:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-27 04:46:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-10-27 04:46:59,335 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 13 [2018-10-27 04:46:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:59,335 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-10-27 04:46:59,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:46:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-10-27 04:46:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 04:46:59,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:59,336 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:59,337 INFO L424 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:46:59,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:59,338 INFO L82 PathProgramCache]: Analyzing trace with hash 494038318, now seen corresponding path program 1 times [2018-10-27 04:46:59,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:46:59,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:59,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:59,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:59,339 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:46:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:59,591 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-27 04:46:59,752 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-10-27 04:46:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:46:59,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:59,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:46:59,785 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:46:59,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:59,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:59,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:59,787 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 5 states. [2018-10-27 04:47:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:00,252 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-10-27 04:47:00,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:00,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-27 04:47:00,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:00,255 INFO L225 Difference]: With dead ends: 85 [2018-10-27 04:47:00,255 INFO L226 Difference]: Without dead ends: 85 [2018-10-27 04:47:00,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-27 04:47:00,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-10-27 04:47:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-27 04:47:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-10-27 04:47:00,264 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 14 [2018-10-27 04:47:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:00,264 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-10-27 04:47:00,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-10-27 04:47:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 04:47:00,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:00,265 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:00,266 INFO L424 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:00,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash -786803888, now seen corresponding path program 1 times [2018-10-27 04:47:00,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:00,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:00,268 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:00,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:00,508 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:00,509 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-10-27 04:47:00,510 INFO L202 CegarAbsIntRunner]: [0], [1], [106], [110], [115], [117], [118], [119], [121], [127], [129], [131], [133], [134], [135], [137] [2018-10-27 04:47:00,554 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:00,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:01,338 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:01,344 INFO L272 AbstractInterpreter]: Visited 16 different actions 64 times. Merged at 6 different actions 48 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-10-27 04:47:01,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:01,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:01,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:01,368 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/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-10-27 04:47:01,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:01,376 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:01,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:01,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-27 04:47:01,515 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:01,516 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:01,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 30 [2018-10-27 04:47:01,532 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:01,548 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:01,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-10-27 04:47:01,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 37 [2018-10-27 04:47:01,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:02,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:02,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:02,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:02,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-10-27 04:47:02,204 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:02,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2018-10-27 04:47:02,318 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:02,319 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:02,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-27 04:47:02,320 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,368 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:02,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:02,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:02,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-10-27 04:47:02,372 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,382 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,386 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:02,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:02,408 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:68 [2018-10-27 04:47:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:02,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:03,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:03,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2018-10-27 04:47:03,194 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:03,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:47:03,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:47:03,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:47:03,195 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 11 states. [2018-10-27 04:47:05,198 WARN L179 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2018-10-27 04:47:05,423 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2018-10-27 04:47:08,102 WARN L179 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-10-27 04:47:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:08,381 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-10-27 04:47:08,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:47:08,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-27 04:47:08,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:08,384 INFO L225 Difference]: With dead ends: 89 [2018-10-27 04:47:08,384 INFO L226 Difference]: Without dead ends: 89 [2018-10-27 04:47:08,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:47:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-27 04:47:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2018-10-27 04:47:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-27 04:47:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-10-27 04:47:08,392 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 19 [2018-10-27 04:47:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:08,392 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-10-27 04:47:08,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:47:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-10-27 04:47:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 04:47:08,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:08,393 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:08,394 INFO L424 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:08,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:08,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1273936261, now seen corresponding path program 1 times [2018-10-27 04:47:08,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:08,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:08,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:08,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:08,397 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 04:47:08,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:08,560 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:08,560 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-27 04:47:08,560 INFO L202 CegarAbsIntRunner]: [0], [1], [29], [33], [38], [39], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [129], [130], [131], [133], [134], [135], [137] [2018-10-27 04:47:08,563 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:08,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:08,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:08,959 INFO L272 AbstractInterpreter]: Visited 23 different actions 71 times. Merged at 5 different actions 40 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-10-27 04:47:09,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:09,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:09,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:09,004 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/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-10-27 04:47:09,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:09,024 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:09,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:09,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:09,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:09,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2018-10-27 04:47:09,185 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:09,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:47:09,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:47:09,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:47:09,186 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 11 states. [2018-10-27 04:47:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:09,566 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-10-27 04:47:09,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:47:09,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-10-27 04:47:09,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:09,580 INFO L225 Difference]: With dead ends: 93 [2018-10-27 04:47:09,580 INFO L226 Difference]: Without dead ends: 93 [2018-10-27 04:47:09,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-10-27 04:47:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-27 04:47:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-10-27 04:47:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-27 04:47:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-10-27 04:47:09,589 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 29 [2018-10-27 04:47:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:09,589 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-10-27 04:47:09,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:47:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-10-27 04:47:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 04:47:09,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:09,590 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:09,591 INFO L424 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:09,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:09,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1480398001, now seen corresponding path program 1 times [2018-10-27 04:47:09,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:09,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:09,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:09,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:09,595 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:09,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:09,696 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:09,696 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-10-27 04:47:09,696 INFO L202 CegarAbsIntRunner]: [0], [1], [29], [33], [38], [40], [41], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [129], [130], [131], [133], [134], [135], [137] [2018-10-27 04:47:09,698 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:09,698 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:10,036 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:10,036 INFO L272 AbstractInterpreter]: Visited 24 different actions 72 times. Merged at 5 different actions 40 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-10-27 04:47:10,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:10,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:10,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:10,079 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/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-10-27 04:47:10,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:10,090 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:10,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:10,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:10,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:10,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-10-27 04:47:10,222 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:10,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:10,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:10,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:10,222 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 7 states. [2018-10-27 04:47:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:10,280 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-10-27 04:47:10,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:10,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-10-27 04:47:10,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:10,284 INFO L225 Difference]: With dead ends: 93 [2018-10-27 04:47:10,284 INFO L226 Difference]: Without dead ends: 93 [2018-10-27 04:47:10,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 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-10-27 04:47:10,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-27 04:47:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2018-10-27 04:47:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-27 04:47:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-10-27 04:47:10,291 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 35 [2018-10-27 04:47:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:10,292 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-10-27 04:47:10,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-10-27 04:47:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 04:47:10,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:10,293 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:10,293 INFO L424 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:10,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:10,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1779855763, now seen corresponding path program 2 times [2018-10-27 04:47:10,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:10,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:10,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:10,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:10,294 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:10,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:10,438 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:10,438 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:10,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:10,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:10,439 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/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-10-27 04:47:10,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:10,446 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:10,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:10,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:10,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:10,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-10-27 04:47:10,597 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 49 [2018-10-27 04:47:10,676 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-10-27 04:47:10,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,698 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,699 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,700 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,721 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2018-10-27 04:47:10,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,760 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,761 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,764 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 57 [2018-10-27 04:47:10,917 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-10-27 04:47:10,919 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,920 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,922 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,923 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,924 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,926 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,927 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-10-27 04:47:10,928 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,955 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,956 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,957 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,958 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,961 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2018-10-27 04:47:10,962 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,987 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:11,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:11,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:11,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-27 04:47:11,032 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:11,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 30 [2018-10-27 04:47:11,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-10-27 04:47:11,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 51 [2018-10-27 04:47:11,040 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:11,051 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:11,056 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:11,061 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:11,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:11,072 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:61, output treesize:23 [2018-10-27 04:47:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 04:47:11,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:11,526 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:47:11,845 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-10-27 04:47:11,937 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-10-27 04:47:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 04:47:12,130 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:12,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2018-10-27 04:47:12,130 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:12,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:12,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:12,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:47:12,131 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 7 states. [2018-10-27 04:47:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:12,484 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2018-10-27 04:47:12,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:12,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-10-27 04:47:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:12,486 INFO L225 Difference]: With dead ends: 94 [2018-10-27 04:47:12,486 INFO L226 Difference]: Without dead ends: 94 [2018-10-27 04:47:12,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:47:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-27 04:47:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-10-27 04:47:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-27 04:47:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-10-27 04:47:12,490 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 40 [2018-10-27 04:47:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:12,492 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-10-27 04:47:12,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-10-27 04:47:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-27 04:47:12,493 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:12,493 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:12,493 INFO L424 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:12,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash 659046269, now seen corresponding path program 1 times [2018-10-27 04:47:12,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:12,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:12,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:12,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:12,495 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:12,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:12,742 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:12,742 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-10-27 04:47:12,742 INFO L202 CegarAbsIntRunner]: [0], [1], [29], [33], [38], [40], [42], [43], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [129], [130], [131], [133], [134], [135], [137] [2018-10-27 04:47:12,744 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:12,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:13,083 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:13,084 INFO L272 AbstractInterpreter]: Visited 25 different actions 73 times. Merged at 5 different actions 40 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 41 variables. [2018-10-27 04:47:13,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:13,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:13,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:13,085 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/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-10-27 04:47:13,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:13,091 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:13,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:13,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:13,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:13,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-10-27 04:47:13,216 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:13,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:47:13,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:47:13,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:13,217 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 8 states. [2018-10-27 04:47:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:13,234 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-10-27 04:47:13,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:13,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-10-27 04:47:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:13,241 INFO L225 Difference]: With dead ends: 97 [2018-10-27 04:47:13,242 INFO L226 Difference]: Without dead ends: 97 [2018-10-27 04:47:13,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-27 04:47:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-10-27 04:47:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-27 04:47:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-10-27 04:47:13,246 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 41 [2018-10-27 04:47:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:13,246 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-10-27 04:47:13,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:47:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-10-27 04:47:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 04:47:13,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:13,251 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:13,252 INFO L424 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:13,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:13,253 INFO L82 PathProgramCache]: Analyzing trace with hash 732140571, now seen corresponding path program 2 times [2018-10-27 04:47:13,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:13,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:13,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:13,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:13,254 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:13,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:13,318 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:13,318 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:13,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:13,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:13,319 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/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-10-27 04:47:13,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:13,326 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:13,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:13,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:13,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:13,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-10-27 04:47:13,364 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:13,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2018-10-27 04:47:13,377 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:13,379 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:13,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2018-10-27 04:47:13,389 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:13,393 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:13,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 39 [2018-10-27 04:47:13,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-10-27 04:47:13,407 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:13,432 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:13,434 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:13,435 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:13,438 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:13,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 42 [2018-10-27 04:47:13,443 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:13,473 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:13,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-10-27 04:47:13,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-10-27 04:47:13,512 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:13,520 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:13,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:47:13,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-10-27 04:47:13,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-10-27 04:47:13,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-27 04:47:13,594 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:13,600 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:13,605 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:13,636 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:47:13,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:47:13,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-10-27 04:47:13,693 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:18, output treesize:114 [2018-10-27 04:47:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 04:47:13,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 04:47:13,795 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:13,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 12 [2018-10-27 04:47:13,795 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:13,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:47:13,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:47:13,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:47:13,796 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 4 states. [2018-10-27 04:47:13,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:13,902 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-10-27 04:47:13,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:47:13,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-10-27 04:47:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:13,904 INFO L225 Difference]: With dead ends: 100 [2018-10-27 04:47:13,904 INFO L226 Difference]: Without dead ends: 100 [2018-10-27 04:47:13,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:13,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-27 04:47:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-10-27 04:47:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-27 04:47:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-10-27 04:47:13,910 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 46 [2018-10-27 04:47:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:13,910 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-10-27 04:47:13,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:47:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-10-27 04:47:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-27 04:47:13,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:13,913 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:13,914 INFO L424 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:13,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:13,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1221521297, now seen corresponding path program 1 times [2018-10-27 04:47:13,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:13,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:13,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:13,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:13,915 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:14,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:14,031 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:14,031 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-10-27 04:47:14,031 INFO L202 CegarAbsIntRunner]: [0], [1], [29], [33], [38], [40], [42], [44], [45], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [129], [130], [131], [133], [134], [135], [137] [2018-10-27 04:47:14,033 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:14,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:14,356 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:14,356 INFO L272 AbstractInterpreter]: Visited 26 different actions 74 times. Merged at 5 different actions 40 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 41 variables. [2018-10-27 04:47:14,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:14,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:14,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:14,358 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:47:14,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:14,382 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:14,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:14,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:14,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:14,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-10-27 04:47:14,529 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:14,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:47:14,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:47:14,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:14,530 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 9 states. [2018-10-27 04:47:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:14,546 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-10-27 04:47:14,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:47:14,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-10-27 04:47:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:14,547 INFO L225 Difference]: With dead ends: 101 [2018-10-27 04:47:14,547 INFO L226 Difference]: Without dead ends: 101 [2018-10-27 04:47:14,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 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-10-27 04:47:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-27 04:47:14,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-10-27 04:47:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-27 04:47:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-10-27 04:47:14,553 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 47 [2018-10-27 04:47:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:14,553 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-10-27 04:47:14,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:47:14,553 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-10-27 04:47:14,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 04:47:14,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:14,554 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:14,554 INFO L424 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:14,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:14,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1905011281, now seen corresponding path program 2 times [2018-10-27 04:47:14,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:14,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:14,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:14,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:14,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:14,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:14,726 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:14,726 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:14,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:14,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:14,726 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/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-10-27 04:47:14,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:14,734 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:14,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:14,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:14,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:14,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-10-27 04:47:14,771 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2018-10-27 04:47:14,778 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,780 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2018-10-27 04:47:14,812 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,813 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,814 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-10-27 04:47:14,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:14,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,831 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,833 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,834 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,836 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:47:14,837 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:14,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:14,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-10-27 04:47:14,865 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,866 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,867 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-27 04:47:14,868 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:14,871 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:14,878 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:14,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:14,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-27 04:47:14,891 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 24 [2018-10-27 04:47:14,901 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,903 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2018-10-27 04:47:14,911 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,912 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:14,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 49 [2018-10-27 04:47:14,915 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:14,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-10-27 04:47:14,941 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:14,957 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:14,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-10-27 04:47:14,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-10-27 04:47:14,984 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:14,990 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:15,007 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:15,022 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:15,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:15,069 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:36, output treesize:34 [2018-10-27 04:47:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-27 04:47:15,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-27 04:47:15,366 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:15,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 17 [2018-10-27 04:47:15,366 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:15,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:15,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:15,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:47:15,369 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 6 states. [2018-10-27 04:47:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:15,563 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-10-27 04:47:15,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:15,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-10-27 04:47:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:15,564 INFO L225 Difference]: With dead ends: 101 [2018-10-27 04:47:15,565 INFO L226 Difference]: Without dead ends: 101 [2018-10-27 04:47:15,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-10-27 04:47:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-27 04:47:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-10-27 04:47:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-27 04:47:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-10-27 04:47:15,569 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 52 [2018-10-27 04:47:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:15,570 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-10-27 04:47:15,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-10-27 04:47:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-27 04:47:15,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:15,571 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:15,574 INFO L424 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:15,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:15,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1490261631, now seen corresponding path program 1 times [2018-10-27 04:47:15,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:15,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:15,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:15,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:15,575 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:15,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:15,713 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:15,713 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-10-27 04:47:15,713 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [7], [12], [13], [29], [33], [36], [38], [40], [42], [44], [46], [48], [52], [53], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [128], [129], [130], [131], [133], [134], [135], [137] [2018-10-27 04:47:15,715 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:15,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:16,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:16,592 INFO L272 AbstractInterpreter]: Visited 35 different actions 147 times. Merged at 12 different actions 96 times. Widened at 2 different actions 8 times. Found 2 fixpoints after 2 different actions. Largest state had 44 variables. [2018-10-27 04:47:16,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:16,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:16,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:16,635 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/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-10-27 04:47:16,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:16,646 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:16,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:16,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:17,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:17,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-10-27 04:47:17,060 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:17,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:47:17,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:47:17,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:17,060 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 10 states. [2018-10-27 04:47:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:17,102 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-10-27 04:47:17,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:47:17,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2018-10-27 04:47:17,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:17,104 INFO L225 Difference]: With dead ends: 107 [2018-10-27 04:47:17,104 INFO L226 Difference]: Without dead ends: 107 [2018-10-27 04:47:17,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-27 04:47:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-10-27 04:47:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-27 04:47:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-10-27 04:47:17,107 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 62 [2018-10-27 04:47:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:17,109 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-10-27 04:47:17,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:47:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-10-27 04:47:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-27 04:47:17,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:17,110 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:17,111 INFO L424 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:17,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:17,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1635173283, now seen corresponding path program 2 times [2018-10-27 04:47:17,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:17,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:17,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:17,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:17,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:17,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:17,680 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:17,680 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:17,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:17,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:17,680 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:17,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:17,693 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:17,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:17,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:17,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:17,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-10-27 04:47:17,803 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:17,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 38 [2018-10-27 04:47:17,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-27 04:47:17,857 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:17,858 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:17,861 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:17,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 45 [2018-10-27 04:47:17,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-10-27 04:47:17,866 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:17,906 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:17,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:17,929 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:17,931 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:17,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2018-10-27 04:47:17,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:17,980 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:17,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:17,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 56 [2018-10-27 04:47:17,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-10-27 04:47:17,987 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:17,998 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,017 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,018 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,021 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,022 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,024 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 62 [2018-10-27 04:47:18,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 54 [2018-10-27 04:47:18,041 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:18,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,085 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,086 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,087 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:18,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 58 [2018-10-27 04:47:18,088 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:18,133 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:18,174 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:47:18,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:47:18,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:47:18,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-10-27 04:47:18,315 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:36, output treesize:174 [2018-10-27 04:47:19,240 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-27 04:47:19,298 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:19,300 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:19,302 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:19,303 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:19,305 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:19,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 63 [2018-10-27 04:47:19,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:19,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-10-27 04:47:19,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:19,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-10-27 04:47:19,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:71, output treesize:123 [2018-10-27 04:47:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-10-27 04:47:19,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-10-27 04:47:19,759 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:19,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 20 [2018-10-27 04:47:19,759 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:19,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:19,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:19,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:47:19,760 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 7 states. [2018-10-27 04:47:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:20,124 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-10-27 04:47:20,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:20,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-10-27 04:47:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:20,126 INFO L225 Difference]: With dead ends: 106 [2018-10-27 04:47:20,126 INFO L226 Difference]: Without dead ends: 106 [2018-10-27 04:47:20,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 121 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-10-27 04:47:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-27 04:47:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-10-27 04:47:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-27 04:47:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-10-27 04:47:20,128 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 67 [2018-10-27 04:47:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:20,129 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-10-27 04:47:20,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-10-27 04:47:20,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-27 04:47:20,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:20,130 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:20,130 INFO L424 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:20,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:20,130 INFO L82 PathProgramCache]: Analyzing trace with hash -849235733, now seen corresponding path program 1 times [2018-10-27 04:47:20,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:20,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:20,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:20,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:20,131 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:20,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:20,514 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:20,514 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-10-27 04:47:20,514 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [7], [12], [14], [15], [29], [33], [36], [38], [40], [42], [44], [46], [48], [52], [53], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [128], [129], [130], [131], [133], [134], [135], [137] [2018-10-27 04:47:20,516 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:20,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:21,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:21,409 INFO L272 AbstractInterpreter]: Visited 36 different actions 148 times. Merged at 12 different actions 96 times. Widened at 2 different actions 8 times. Found 2 fixpoints after 2 different actions. Largest state had 44 variables. [2018-10-27 04:47:21,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:21,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:21,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:21,411 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:21,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:21,418 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:21,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:21,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:21,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:21,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-10-27 04:47:21,586 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:21,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:47:21,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:47:21,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:21,586 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 11 states. [2018-10-27 04:47:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:21,642 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-10-27 04:47:21,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:47:21,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-10-27 04:47:21,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:21,647 INFO L225 Difference]: With dead ends: 111 [2018-10-27 04:47:21,648 INFO L226 Difference]: Without dead ends: 111 [2018-10-27 04:47:21,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-27 04:47:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-10-27 04:47:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-27 04:47:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-10-27 04:47:21,650 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 68 [2018-10-27 04:47:21,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:21,650 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-10-27 04:47:21,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:47:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-10-27 04:47:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-27 04:47:21,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:21,656 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:21,657 INFO L424 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:21,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:21,657 INFO L82 PathProgramCache]: Analyzing trace with hash 529820045, now seen corresponding path program 2 times [2018-10-27 04:47:21,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:21,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:21,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:21,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:21,658 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:21,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:21,749 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:21,749 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:21,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:21,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:21,750 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:21,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:21,757 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:21,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:21,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:21,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:21,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-10-27 04:47:21,785 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2018-10-27 04:47:21,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-10-27 04:47:21,799 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,800 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,802 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2018-10-27 04:47:21,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:21,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:21,870 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,872 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2018-10-27 04:47:21,904 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,905 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,906 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-10-27 04:47:21,907 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:21,924 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,925 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,927 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,928 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,971 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 04:47:21,972 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:21,991 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,000 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-27 04:47:22,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 24 [2018-10-27 04:47:22,021 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,023 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2018-10-27 04:47:22,031 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,032 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 49 [2018-10-27 04:47:22,035 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 35 [2018-10-27 04:47:22,054 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,067 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:22,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-10-27 04:47:22,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-10-27 04:47:22,087 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,094 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,110 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:22,126 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:22,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:22,147 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:36, output treesize:34 [2018-10-27 04:47:22,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:47:22,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:22,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-10-27 04:47:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-27 04:47:22,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:24,474 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:47:27,821 WARN L179 SmtUtils]: Spent 3.31 s on a formula simplification that was a NOOP. DAG size: 51 [2018-10-27 04:47:27,825 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-10-27 04:47:27,877 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-10-27 04:47:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-27 04:47:27,995 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:27,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [11] total 21 [2018-10-27 04:47:27,995 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:27,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:27,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:27,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=336, Unknown=2, NotChecked=0, Total=420 [2018-10-27 04:47:27,996 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 7 states. [2018-10-27 04:47:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:28,238 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-10-27 04:47:28,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:28,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-10-27 04:47:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:28,239 INFO L225 Difference]: With dead ends: 112 [2018-10-27 04:47:28,240 INFO L226 Difference]: Without dead ends: 112 [2018-10-27 04:47:28,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=103, Invalid=447, Unknown=2, NotChecked=0, Total=552 [2018-10-27 04:47:28,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-27 04:47:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2018-10-27 04:47:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-27 04:47:28,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-10-27 04:47:28,243 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 73 [2018-10-27 04:47:28,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:28,243 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-10-27 04:47:28,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:28,243 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-10-27 04:47:28,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-27 04:47:28,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:28,244 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:28,244 INFO L424 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:28,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:28,245 INFO L82 PathProgramCache]: Analyzing trace with hash -755447741, now seen corresponding path program 1 times [2018-10-27 04:47:28,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:28,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:28,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:28,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:28,245 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-27 04:47:28,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:28,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:47:28,362 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:28,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:47:28,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:47:28,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:47:28,363 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 4 states. [2018-10-27 04:47:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:28,469 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-10-27 04:47:28,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:47:28,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-10-27 04:47:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:28,471 INFO L225 Difference]: With dead ends: 111 [2018-10-27 04:47:28,471 INFO L226 Difference]: Without dead ends: 111 [2018-10-27 04:47:28,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:28,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-27 04:47:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2018-10-27 04:47:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-27 04:47:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2018-10-27 04:47:28,474 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 74 [2018-10-27 04:47:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:28,474 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2018-10-27 04:47:28,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:47:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-10-27 04:47:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-27 04:47:28,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:28,475 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:28,475 INFO L424 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:28,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:28,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1944043441, now seen corresponding path program 1 times [2018-10-27 04:47:28,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:28,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:28,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:28,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:28,476 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:28,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:28,759 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:28,759 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2018-10-27 04:47:28,759 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [7], [12], [14], [16], [18], [19], [29], [33], [36], [38], [40], [42], [44], [46], [48], [52], [53], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [128], [129], [130], [131], [133], [134], [135], [137] [2018-10-27 04:47:28,761 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:28,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:29,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:29,759 INFO L272 AbstractInterpreter]: Visited 38 different actions 150 times. Merged at 12 different actions 96 times. Widened at 2 different actions 8 times. Found 2 fixpoints after 2 different actions. Largest state had 48 variables. [2018-10-27 04:47:29,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:29,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:29,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:29,824 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:47:29,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:29,836 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:29,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:30,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:30,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:30,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-10-27 04:47:30,245 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:30,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:47:30,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:47:30,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:30,246 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 12 states. [2018-10-27 04:47:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:30,282 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-10-27 04:47:30,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:47:30,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-10-27 04:47:30,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:30,284 INFO L225 Difference]: With dead ends: 114 [2018-10-27 04:47:30,284 INFO L226 Difference]: Without dead ends: 114 [2018-10-27 04:47:30,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 141 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-27 04:47:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-10-27 04:47:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-27 04:47:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-10-27 04:47:30,291 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 75 [2018-10-27 04:47:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:30,291 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-10-27 04:47:30,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:47:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-10-27 04:47:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-27 04:47:30,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:30,292 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:30,293 INFO L424 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:30,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:30,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1382870381, now seen corresponding path program 2 times [2018-10-27 04:47:30,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:30,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:30,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:30,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:30,294 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:30,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:30,485 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:30,485 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:30,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:30,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:30,485 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:30,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:30,493 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:30,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:30,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:30,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:30,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:47:30,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:30,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:30,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-10-27 04:47:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-10-27 04:47:30,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-10-27 04:47:30,745 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:30,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [12] total 18 [2018-10-27 04:47:30,745 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:30,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:30,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:30,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:47:30,746 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 5 states. [2018-10-27 04:47:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:30,849 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-10-27 04:47:30,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:30,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-10-27 04:47:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:30,850 INFO L225 Difference]: With dead ends: 114 [2018-10-27 04:47:30,850 INFO L226 Difference]: Without dead ends: 114 [2018-10-27 04:47:30,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:47:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-27 04:47:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-10-27 04:47:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-27 04:47:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-10-27 04:47:30,853 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 80 [2018-10-27 04:47:30,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:30,853 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-10-27 04:47:30,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-10-27 04:47:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 04:47:30,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:30,854 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:30,854 INFO L424 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:30,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:30,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1627725795, now seen corresponding path program 1 times [2018-10-27 04:47:30,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:30,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:30,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:30,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:30,860 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 04:47:31,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:31,419 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:31,419 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2018-10-27 04:47:31,419 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [7], [10], [12], [14], [16], [18], [20], [22], [26], [27], [29], [33], [36], [38], [40], [42], [44], [46], [48], [52], [53], [55], [59], [64], [65], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [128], [129], [130], [131], [132], [133], [134], [135], [137] [2018-10-27 04:47:31,421 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:31,421 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:33,024 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:33,025 INFO L272 AbstractInterpreter]: Visited 47 different actions 223 times. Merged at 19 different actions 152 times. Widened at 3 different actions 12 times. Found 3 fixpoints after 3 different actions. Largest state had 54 variables. [2018-10-27 04:47:33,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:33,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:33,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:33,067 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:33,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:33,078 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:33,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 04:47:33,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 04:47:33,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:33,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-10-27 04:47:33,994 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:33,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:47:33,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:47:33,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:33,995 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 13 states. [2018-10-27 04:47:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:34,069 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-10-27 04:47:34,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:47:34,071 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2018-10-27 04:47:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:34,072 INFO L225 Difference]: With dead ends: 117 [2018-10-27 04:47:34,072 INFO L226 Difference]: Without dead ends: 117 [2018-10-27 04:47:34,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 170 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-27 04:47:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-10-27 04:47:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-27 04:47:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-10-27 04:47:34,075 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 90 [2018-10-27 04:47:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:34,077 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-10-27 04:47:34,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:47:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-10-27 04:47:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-27 04:47:34,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:34,078 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:34,078 INFO L424 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:34,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:34,079 INFO L82 PathProgramCache]: Analyzing trace with hash -113863873, now seen corresponding path program 2 times [2018-10-27 04:47:34,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:34,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:34,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:34,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:34,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 04:47:34,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:34,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:34,170 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:34,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:34,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:34,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:34,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:34,179 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:34,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 04:47:34,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:34,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 04:47:34,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:34,434 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 04:47:34,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:34,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-10-27 04:47:34,450 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:34,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:34,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:34,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:34,451 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 5 states. [2018-10-27 04:47:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:34,474 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-10-27 04:47:34,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:47:34,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-10-27 04:47:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:34,476 INFO L225 Difference]: With dead ends: 129 [2018-10-27 04:47:34,476 INFO L226 Difference]: Without dead ends: 129 [2018-10-27 04:47:34,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-27 04:47:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2018-10-27 04:47:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-27 04:47:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2018-10-27 04:47:34,479 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 95 [2018-10-27 04:47:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:34,479 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2018-10-27 04:47:34,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2018-10-27 04:47:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-27 04:47:34,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:34,480 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:34,481 INFO L424 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:34,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:34,481 INFO L82 PathProgramCache]: Analyzing trace with hash -166389338, now seen corresponding path program 3 times [2018-10-27 04:47:34,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:34,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:34,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:34,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:34,482 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 04:47:34,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:34,617 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:34,617 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:34,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:34,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:34,617 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:34,626 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:47:34,627 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 04:47:34,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:47:34,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:34,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 04:47:34,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 04:47:34,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:34,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-10-27 04:47:34,876 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:34,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:34,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:34,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:47:34,877 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 6 states. [2018-10-27 04:47:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:34,891 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-10-27 04:47:34,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:47:34,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-10-27 04:47:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:34,893 INFO L225 Difference]: With dead ends: 136 [2018-10-27 04:47:34,893 INFO L226 Difference]: Without dead ends: 136 [2018-10-27 04:47:34,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:47:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-27 04:47:34,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2018-10-27 04:47:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-27 04:47:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-10-27 04:47:34,896 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 102 [2018-10-27 04:47:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:34,896 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-10-27 04:47:34,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-10-27 04:47:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-27 04:47:34,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:34,897 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:34,898 INFO L424 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:34,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:34,898 INFO L82 PathProgramCache]: Analyzing trace with hash 210559327, now seen corresponding path program 4 times [2018-10-27 04:47:34,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:34,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:34,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:34,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:34,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 04:47:35,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:35,189 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:35,190 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:35,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:35,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:35,190 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:35,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:35,198 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:35,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 04:47:35,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 04:47:35,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:35,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-10-27 04:47:35,726 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:35,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:35,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:35,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:35,727 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 7 states. [2018-10-27 04:47:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:35,746 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-10-27 04:47:35,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:35,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-10-27 04:47:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:35,748 INFO L225 Difference]: With dead ends: 143 [2018-10-27 04:47:35,748 INFO L226 Difference]: Without dead ends: 143 [2018-10-27 04:47:35,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:35,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-27 04:47:35,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 138. [2018-10-27 04:47:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-27 04:47:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2018-10-27 04:47:35,751 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 109 [2018-10-27 04:47:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:35,751 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2018-10-27 04:47:35,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2018-10-27 04:47:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-27 04:47:35,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:35,752 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:35,752 INFO L424 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:35,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:35,753 INFO L82 PathProgramCache]: Analyzing trace with hash 768649094, now seen corresponding path program 5 times [2018-10-27 04:47:35,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:35,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:35,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:35,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:35,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 04:47:35,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:35,935 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:35,935 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:35,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:35,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:35,936 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:35,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:35,945 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:36,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 04:47:36,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:36,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-10-27 04:47:36,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-10-27 04:47:36,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:36,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2018-10-27 04:47:36,100 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:36,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:47:36,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:47:36,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:36,100 INFO L87 Difference]: Start difference. First operand 138 states and 142 transitions. Second operand 9 states. [2018-10-27 04:47:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:36,149 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2018-10-27 04:47:36,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:47:36,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2018-10-27 04:47:36,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:36,153 INFO L225 Difference]: With dead ends: 162 [2018-10-27 04:47:36,153 INFO L226 Difference]: Without dead ends: 162 [2018-10-27 04:47:36,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:36,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-27 04:47:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2018-10-27 04:47:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-27 04:47:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2018-10-27 04:47:36,156 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 116 [2018-10-27 04:47:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:36,156 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-10-27 04:47:36,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:47:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2018-10-27 04:47:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-27 04:47:36,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:36,157 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:36,158 INFO L424 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:36,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:36,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2015781474, now seen corresponding path program 6 times [2018-10-27 04:47:36,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:36,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:36,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:36,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:36,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-27 04:47:36,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:36,337 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:36,337 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:36,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:36,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:36,337 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:36,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:47:36,346 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 04:47:36,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:47:36,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:36,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-27 04:47:36,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-27 04:47:36,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:36,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-10-27 04:47:36,475 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:36,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:47:36,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:47:36,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:36,476 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 9 states. [2018-10-27 04:47:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:36,496 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2018-10-27 04:47:36,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:47:36,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2018-10-27 04:47:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:36,497 INFO L225 Difference]: With dead ends: 164 [2018-10-27 04:47:36,497 INFO L226 Difference]: Without dead ends: 164 [2018-10-27 04:47:36,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 254 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-10-27 04:47:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-27 04:47:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2018-10-27 04:47:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-27 04:47:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2018-10-27 04:47:36,501 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 130 [2018-10-27 04:47:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:36,501 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2018-10-27 04:47:36,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:47:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2018-10-27 04:47:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-27 04:47:36,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:36,502 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:36,502 INFO L424 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:36,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash -886241833, now seen corresponding path program 7 times [2018-10-27 04:47:36,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:36,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:36,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:36,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:36,503 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-27 04:47:36,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:36,620 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:36,620 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:36,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:36,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:36,620 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:36,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:36,629 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:36,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-27 04:47:36,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-27 04:47:36,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:36,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-10-27 04:47:36,763 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:36,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:47:36,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:47:36,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:36,763 INFO L87 Difference]: Start difference. First operand 159 states and 163 transitions. Second operand 10 states. [2018-10-27 04:47:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:36,797 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-10-27 04:47:36,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:47:36,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 137 [2018-10-27 04:47:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:36,799 INFO L225 Difference]: With dead ends: 171 [2018-10-27 04:47:36,799 INFO L226 Difference]: Without dead ends: 171 [2018-10-27 04:47:36,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 267 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-27 04:47:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2018-10-27 04:47:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-27 04:47:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions. [2018-10-27 04:47:36,803 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 137 [2018-10-27 04:47:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:36,803 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions. [2018-10-27 04:47:36,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:47:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2018-10-27 04:47:36,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-27 04:47:36,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:36,804 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:36,804 INFO L424 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:36,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:36,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1339530110, now seen corresponding path program 8 times [2018-10-27 04:47:36,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:36,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:36,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:36,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:36,805 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-27 04:47:37,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:37,006 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:37,006 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:37,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:37,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:37,007 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:37,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:37,015 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:37,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 04:47:37,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:37,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-10-27 04:47:37,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-10-27 04:47:37,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:37,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 17 [2018-10-27 04:47:37,313 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:37,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 04:47:37,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 04:47:37,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:47:37,314 INFO L87 Difference]: Start difference. First operand 166 states and 170 transitions. Second operand 14 states. [2018-10-27 04:47:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:37,401 INFO L93 Difference]: Finished difference Result 190 states and 194 transitions. [2018-10-27 04:47:37,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 04:47:37,403 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 144 [2018-10-27 04:47:37,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:37,404 INFO L225 Difference]: With dead ends: 190 [2018-10-27 04:47:37,404 INFO L226 Difference]: Without dead ends: 190 [2018-10-27 04:47:37,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:47:37,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-27 04:47:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2018-10-27 04:47:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-27 04:47:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 184 transitions. [2018-10-27 04:47:37,411 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 184 transitions. Word has length 144 [2018-10-27 04:47:37,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:37,412 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 184 transitions. [2018-10-27 04:47:37,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 04:47:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 184 transitions. [2018-10-27 04:47:37,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-27 04:47:37,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:37,413 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:37,413 INFO L424 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:37,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:37,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1683255846, now seen corresponding path program 9 times [2018-10-27 04:47:37,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:37,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:37,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:37,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:37,414 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-27 04:47:37,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:37,633 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:37,633 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:37,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:37,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:37,633 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:37,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:47:37,643 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 04:47:37,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:47:37,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:37,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-27 04:47:37,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-27 04:47:38,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:38,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-10-27 04:47:38,478 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:38,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:47:38,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:47:38,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:38,479 INFO L87 Difference]: Start difference. First operand 180 states and 184 transitions. Second operand 12 states. [2018-10-27 04:47:38,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:38,519 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2018-10-27 04:47:38,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:47:38,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 158 [2018-10-27 04:47:38,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:38,523 INFO L225 Difference]: With dead ends: 192 [2018-10-27 04:47:38,523 INFO L226 Difference]: Without dead ends: 192 [2018-10-27 04:47:38,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 307 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-27 04:47:38,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2018-10-27 04:47:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-27 04:47:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 191 transitions. [2018-10-27 04:47:38,527 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 191 transitions. Word has length 158 [2018-10-27 04:47:38,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:38,527 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 191 transitions. [2018-10-27 04:47:38,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:47:38,527 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 191 transitions. [2018-10-27 04:47:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-27 04:47:38,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:38,528 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:38,528 INFO L424 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:38,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:38,528 INFO L82 PathProgramCache]: Analyzing trace with hash -456803617, now seen corresponding path program 10 times [2018-10-27 04:47:38,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:38,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:38,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:38,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:38,529 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-27 04:47:39,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:39,133 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:39,133 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:39,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:39,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:39,134 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:39,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:39,155 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:39,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-27 04:47:39,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:39,539 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-27 04:47:39,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:39,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-10-27 04:47:39,555 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:39,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:47:39,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:47:39,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:39,556 INFO L87 Difference]: Start difference. First operand 187 states and 191 transitions. Second operand 13 states. [2018-10-27 04:47:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:39,588 INFO L93 Difference]: Finished difference Result 194 states and 198 transitions. [2018-10-27 04:47:39,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:47:39,589 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 165 [2018-10-27 04:47:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:39,590 INFO L225 Difference]: With dead ends: 194 [2018-10-27 04:47:39,590 INFO L226 Difference]: Without dead ends: 194 [2018-10-27 04:47:39,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 320 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-27 04:47:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-10-27 04:47:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-27 04:47:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 198 transitions. [2018-10-27 04:47:39,594 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 198 transitions. Word has length 165 [2018-10-27 04:47:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:39,594 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 198 transitions. [2018-10-27 04:47:39,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:47:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2018-10-27 04:47:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 04:47:39,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:39,596 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:39,596 INFO L424 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:39,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:39,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1718820858, now seen corresponding path program 11 times [2018-10-27 04:47:39,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:39,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:39,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:39,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:39,597 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:39,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:39,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:39,831 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:39,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:39,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:39,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:39,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:39,839 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:40,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 04:47:40,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:40,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:40,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:41,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:41,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2018-10-27 04:47:41,044 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:41,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:47:41,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:47:41,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=82, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:41,045 INFO L87 Difference]: Start difference. First operand 194 states and 198 transitions. Second operand 9 states. [2018-10-27 04:47:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:41,260 INFO L93 Difference]: Finished difference Result 206 states and 210 transitions. [2018-10-27 04:47:41,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:41,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 172 [2018-10-27 04:47:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:41,261 INFO L225 Difference]: With dead ends: 206 [2018-10-27 04:47:41,261 INFO L226 Difference]: Without dead ends: 206 [2018-10-27 04:47:41,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=95, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:47:41,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-27 04:47:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 201. [2018-10-27 04:47:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-27 04:47:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2018-10-27 04:47:41,265 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 172 [2018-10-27 04:47:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:41,266 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2018-10-27 04:47:41,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:47:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2018-10-27 04:47:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 04:47:41,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:41,267 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:41,267 INFO L424 AbstractCegarLoop]: === Iteration 29 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:41,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:41,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1315331895, now seen corresponding path program 12 times [2018-10-27 04:47:41,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:41,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:41,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:41,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:41,268 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:41,836 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:41,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:41,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:41,837 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:41,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:41,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:41,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:47:41,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:47:41,853 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:42,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:47:42,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:42,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:42,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:42,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:42,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-10-27 04:47:42,397 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:42,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:47:42,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:47:42,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:42,398 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 8 states. [2018-10-27 04:47:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:42,422 INFO L93 Difference]: Finished difference Result 213 states and 217 transitions. [2018-10-27 04:47:42,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:42,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2018-10-27 04:47:42,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:42,424 INFO L225 Difference]: With dead ends: 213 [2018-10-27 04:47:42,424 INFO L226 Difference]: Without dead ends: 213 [2018-10-27 04:47:42,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-27 04:47:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 208. [2018-10-27 04:47:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-27 04:47:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 212 transitions. [2018-10-27 04:47:42,428 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 212 transitions. Word has length 179 [2018-10-27 04:47:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:42,428 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 212 transitions. [2018-10-27 04:47:42,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:47:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 212 transitions. [2018-10-27 04:47:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-27 04:47:42,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:42,429 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:42,430 INFO L424 AbstractCegarLoop]: === Iteration 30 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:42,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1161193754, now seen corresponding path program 13 times [2018-10-27 04:47:42,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:42,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:42,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:42,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:42,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:42,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:42,556 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:42,556 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:42,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:42,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:42,556 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:42,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:42,568 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:42,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:42,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:42,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:42,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-10-27 04:47:42,839 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:42,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:47:42,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:47:42,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:42,840 INFO L87 Difference]: Start difference. First operand 208 states and 212 transitions. Second operand 9 states. [2018-10-27 04:47:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:42,880 INFO L93 Difference]: Finished difference Result 220 states and 224 transitions. [2018-10-27 04:47:42,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:47:42,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 186 [2018-10-27 04:47:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:42,881 INFO L225 Difference]: With dead ends: 220 [2018-10-27 04:47:42,881 INFO L226 Difference]: Without dead ends: 220 [2018-10-27 04:47:42,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 366 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-10-27 04:47:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-27 04:47:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 215. [2018-10-27 04:47:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-27 04:47:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 219 transitions. [2018-10-27 04:47:42,885 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 219 transitions. Word has length 186 [2018-10-27 04:47:42,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:42,885 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 219 transitions. [2018-10-27 04:47:42,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:47:42,885 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2018-10-27 04:47:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-27 04:47:42,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:42,886 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:42,886 INFO L424 AbstractCegarLoop]: === Iteration 31 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:42,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:42,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1936184233, now seen corresponding path program 14 times [2018-10-27 04:47:42,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:42,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:42,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:42,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:42,887 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:43,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:43,248 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:43,248 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:43,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:43,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:43,248 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:43,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:43,257 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:47,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-27 04:47:47,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:47,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:47,746 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 65 proven. 117 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2018-10-27 04:47:47,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:47,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:47,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 9] total 26 [2018-10-27 04:47:47,886 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:47,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 04:47:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 04:47:47,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=448, Unknown=0, NotChecked=0, Total=650 [2018-10-27 04:47:47,887 INFO L87 Difference]: Start difference. First operand 215 states and 219 transitions. Second operand 23 states. [2018-10-27 04:47:48,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:48,114 INFO L93 Difference]: Finished difference Result 227 states and 231 transitions. [2018-10-27 04:47:48,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:47:48,115 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 193 [2018-10-27 04:47:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:48,116 INFO L225 Difference]: With dead ends: 227 [2018-10-27 04:47:48,116 INFO L226 Difference]: Without dead ends: 227 [2018-10-27 04:47:48,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 366 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2018-10-27 04:47:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-27 04:47:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 222. [2018-10-27 04:47:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-27 04:47:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 226 transitions. [2018-10-27 04:47:48,120 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 226 transitions. Word has length 193 [2018-10-27 04:47:48,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:48,120 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 226 transitions. [2018-10-27 04:47:48,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 04:47:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 226 transitions. [2018-10-27 04:47:48,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-27 04:47:48,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:48,121 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:48,121 INFO L424 AbstractCegarLoop]: === Iteration 32 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:48,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:48,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1601387066, now seen corresponding path program 15 times [2018-10-27 04:47:48,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:48,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:48,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:48,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:48,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:48,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:48,408 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:48,408 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:48,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:48,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:48,409 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:48,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:47:48,417 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 04:47:48,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:47:48,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:48,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:48,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:48,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:48,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-10-27 04:47:48,698 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:48,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:47:48,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:47:48,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:48,699 INFO L87 Difference]: Start difference. First operand 222 states and 226 transitions. Second operand 11 states. [2018-10-27 04:47:49,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:49,004 INFO L93 Difference]: Finished difference Result 234 states and 238 transitions. [2018-10-27 04:47:49,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:47:49,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 200 [2018-10-27 04:47:49,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:49,006 INFO L225 Difference]: With dead ends: 234 [2018-10-27 04:47:49,006 INFO L226 Difference]: Without dead ends: 234 [2018-10-27 04:47:49,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 392 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-27 04:47:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 229. [2018-10-27 04:47:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-27 04:47:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2018-10-27 04:47:49,010 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 200 [2018-10-27 04:47:49,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:49,010 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2018-10-27 04:47:49,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:47:49,010 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2018-10-27 04:47:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-27 04:47:49,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:49,021 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:49,021 INFO L424 AbstractCegarLoop]: === Iteration 33 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:49,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:49,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1869840009, now seen corresponding path program 16 times [2018-10-27 04:47:49,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:49,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:49,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:49,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:49,022 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:49,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:49,883 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:49,883 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:49,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:49,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:49,883 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:49,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:49,893 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:49,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:50,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:50,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:50,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-10-27 04:47:50,176 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:50,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:47:50,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:47:50,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:50,177 INFO L87 Difference]: Start difference. First operand 229 states and 233 transitions. Second operand 12 states. [2018-10-27 04:47:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:50,205 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2018-10-27 04:47:50,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:47:50,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 207 [2018-10-27 04:47:50,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:50,208 INFO L225 Difference]: With dead ends: 241 [2018-10-27 04:47:50,208 INFO L226 Difference]: Without dead ends: 241 [2018-10-27 04:47:50,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 405 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-27 04:47:50,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 236. [2018-10-27 04:47:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-27 04:47:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 240 transitions. [2018-10-27 04:47:50,217 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 240 transitions. Word has length 207 [2018-10-27 04:47:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:50,217 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 240 transitions. [2018-10-27 04:47:50,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:47:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 240 transitions. [2018-10-27 04:47:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-27 04:47:50,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:50,218 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:50,218 INFO L424 AbstractCegarLoop]: === Iteration 34 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:50,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:50,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1037800282, now seen corresponding path program 17 times [2018-10-27 04:47:50,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:50,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:50,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:50,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:50,224 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:47:50,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:50,401 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:50,401 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:50,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:47:50,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:50,402 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:50,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:50,411 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:48:04,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-27 04:48:04,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:48:04,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:48:04,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:48:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-27 04:48:04,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:48:04,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 22 [2018-10-27 04:48:04,402 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:48:04,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 04:48:04,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 04:48:04,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-27 04:48:04,402 INFO L87 Difference]: Start difference. First operand 236 states and 240 transitions. Second operand 21 states. [2018-10-27 04:48:04,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:04,449 INFO L93 Difference]: Finished difference Result 243 states and 247 transitions. [2018-10-27 04:48:04,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:48:04,450 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 214 [2018-10-27 04:48:04,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:04,451 INFO L225 Difference]: With dead ends: 243 [2018-10-27 04:48:04,452 INFO L226 Difference]: Without dead ends: 243 [2018-10-27 04:48:04,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 410 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-10-27 04:48:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-27 04:48:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-10-27 04:48:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-27 04:48:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 247 transitions. [2018-10-27 04:48:04,457 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 247 transitions. Word has length 214 [2018-10-27 04:48:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:04,457 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 247 transitions. [2018-10-27 04:48:04,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 04:48:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 247 transitions. [2018-10-27 04:48:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-27 04:48:04,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:04,458 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:48:04,459 INFO L424 AbstractCegarLoop]: === Iteration 35 === [getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:48:04,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:04,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1355456873, now seen corresponding path program 18 times [2018-10-27 04:48:04,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:48:04,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:48:04,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:48:04,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:48:04,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:48:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 04:48:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 04:48:04,998 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-27 04:48:05,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,017 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,018 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,018 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,038 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,038 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,038 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,039 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,039 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,039 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,042 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,043 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,043 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,043 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,043 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,043 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,043 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,043 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,044 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,044 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,044 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,044 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,044 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,044 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,044 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,044 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,045 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,045 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,045 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,045 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,045 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,045 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,045 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,046 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,047 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,047 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,047 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,047 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,047 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,047 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,047 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,047 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,048 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,048 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,048 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,048 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,048 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,048 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,048 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,049 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,049 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,049 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,049 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,049 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,049 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,049 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,050 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,051 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,051 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,051 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,061 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,061 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,061 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,062 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,062 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,062 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,062 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,062 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,062 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,062 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,064 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,064 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,064 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,064 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,064 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,064 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,064 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,065 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,065 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,065 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,065 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,065 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,065 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,065 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,065 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,068 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,068 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,068 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,068 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,068 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,068 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,068 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,069 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,069 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,069 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,069 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,069 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,069 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,069 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,069 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,070 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,070 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,070 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,070 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,070 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,070 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,070 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,070 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,071 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,071 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,071 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-10-27 04:48:05,083 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-10-27 04:48:05,083 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,083 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,084 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-10-27 04:48:05,084 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-10-27 04:48:05,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:48:05 BoogieIcfgContainer [2018-10-27 04:48:05,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:48:05,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 04:48:05,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 04:48:05,159 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 04:48:05,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:46:58" (3/4) ... [2018-10-27 04:48:05,162 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-27 04:48:05,165 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,165 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,165 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,166 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,176 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,176 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,177 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,177 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,177 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,177 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,177 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,177 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,177 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,177 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,177 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,177 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,178 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,178 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,178 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,178 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,178 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,178 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,178 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,178 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,178 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,179 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,179 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,179 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,179 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,179 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,179 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,179 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,179 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,179 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,182 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,182 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,182 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,182 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,182 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,182 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,182 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,182 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,182 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,183 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,183 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,183 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,183 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,186 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,187 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,188 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,188 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,188 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,188 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,188 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,188 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,188 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,188 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,188 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,189 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,189 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,189 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,189 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,189 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,189 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,189 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,189 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,189 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,190 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,190 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,190 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,190 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,190 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,190 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,190 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,190 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,190 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,191 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,191 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,191 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,191 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,191 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,192 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,192 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,192 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,192 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,192 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,192 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,192 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,192 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,193 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,193 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,193 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,193 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,193 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,193 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,193 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,193 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,193 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,193 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,194 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,194 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,194 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,194 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,194 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,194 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,194 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,194 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,195 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,195 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,195 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,195 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,198 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,198 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,198 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,198 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,198 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,199 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,199 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-10-27 04:48:05,199 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-10-27 04:48:05,199 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,199 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 04:48:05,199 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-10-27 04:48:05,199 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-10-27 04:48:05,272 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f4c22876-bb72-49b5-803b-992b9d135553/bin-2019/utaipan/witness.graphml [2018-10-27 04:48:05,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 04:48:05,273 INFO L168 Benchmark]: Toolchain (without parser) took 68056.26 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 846.2 MB). Free memory was 954.5 MB in the beginning and 1.5 GB in the end (delta: -517.8 MB). Peak memory consumption was 328.4 MB. Max. memory is 11.5 GB. [2018-10-27 04:48:05,276 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:48:05,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.56 ms. Allocated memory is still 1.0 GB. Free memory was 954.5 MB in the beginning and 943.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:48:05,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.85 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:48:05,276 INFO L168 Benchmark]: Boogie Preprocessor took 64.80 ms. Allocated memory is still 1.0 GB. Free memory was 941.0 MB in the beginning and 938.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:48:05,276 INFO L168 Benchmark]: RCFGBuilder took 1060.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-10-27 04:48:05,277 INFO L168 Benchmark]: TraceAbstraction took 66553.60 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 647.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -357.3 MB). Peak memory consumption was 289.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:48:05,277 INFO L168 Benchmark]: Witness Printer took 125.52 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-10-27 04:48:05,278 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 201.56 ms. Allocated memory is still 1.0 GB. Free memory was 954.5 MB in the beginning and 943.7 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 45.85 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.80 ms. Allocated memory is still 1.0 GB. Free memory was 941.0 MB in the beginning and 938.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1060.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 66553.60 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 647.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -357.3 MB). Peak memory consumption was 289.7 MB. Max. memory is 11.5 GB. * Witness Printer took 125.52 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L48] CALL "%d\n" [L48] RET "%d\n" [L6] CALL static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L6] RET static int array[10]; [L17] CALL static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L17] RET static int numbers2[10]; [L36] CALL static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L36] RET static int numbers4[10]; [L45] CALL getNumbers4() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L35] CALL, EXPR getNumbers3() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L25] CALL, EXPR getNumbers2() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L16] CALL, EXPR getNumbers() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] int i = 0; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND TRUE i < 10 [L9] CALL array[i] = i [L9] RET array[i] = i [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L8] COND FALSE !(i < 10) VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L12] RET return array; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L16] EXPR getNumbers() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND TRUE i < 10 [L19] CALL, EXPR numbers[i] [L19] RET, EXPR numbers[i] [L19] CALL numbers2[i] = numbers[i] [L19] RET numbers2[i] = numbers[i] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L18] COND FALSE !(i < 10) VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L21] RET return numbers2; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L25] EXPR getNumbers2() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L25] int* numbers = getNumbers2(); [L26] CALL int numbers3[10]; [L26] RET int numbers3[10]; [L27] int i = 0; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND TRUE i < 10 [L28] CALL, EXPR numbers[i] [L28] RET, EXPR numbers[i] [L28] CALL numbers3[i] = numbers[i] [L28] RET numbers3[i] = numbers[i] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L27] COND FALSE !(i < 10) VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L31] return numbers3; [L31] RET return numbers3; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L35] EXPR getNumbers3() VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL ["%d\n"={110:0}, array={1:0}, numbers2={-1:0}, numbers4={102:0}] [L37] COND TRUE i < 10 [L38] CALL numbers[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 79 locations, 17 error locations. UNSAFE Result, 66.4s OverallTime, 35 OverallIterations, 11 TraceHistogramMax, 9.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2258 SDtfs, 1367 SDslu, 10774 SDs, 0 SdLazy, 2131 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6957 GetRequests, 6439 SyntacticMatches, 94 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 23.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.8s AbstIntTime, 9 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 154 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 21.1s SatisfiabilityAnalysisTime, 26.3s InterpolantComputationTime, 6984 NumberOfCodeBlocks, 6432 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 9998 ConstructedInterpolants, 162 QuantifiedInterpolants, 2870470 SizeOfPredicates, 135 NumberOfNonLiveVariables, 14728 ConjunctsInSsa, 389 ConjunctsInUnsatCore, 96 InterpolantComputations, 15 PerfectInterpolantSequences, 21008/28877 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...