./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.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_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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 b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:47:01,768 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:47:01,769 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:47:01,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:47:01,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:47:01,779 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:47:01,780 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:47:01,781 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:47:01,782 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:47:01,783 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:47:01,784 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:47:01,785 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:47:01,785 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:47:01,786 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:47:01,787 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:47:01,787 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:47:01,788 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:47:01,789 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:47:01,790 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:47:01,799 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:47:01,802 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:47:01,803 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:47:01,806 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:47:01,810 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:47:01,810 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:47:01,811 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:47:01,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:47:01,812 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:47:01,813 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:47:01,813 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:47:01,814 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:47:01,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:47:01,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:47:01,814 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:47:01,818 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:47:01,819 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:47:01,819 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-10-27 04:47:01,829 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:47:01,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:47:01,830 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 04:47:01,830 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 04:47:01,830 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 04:47:01,830 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 04:47:01,830 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 04:47:01,831 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 04:47:01,831 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 04:47:01,832 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 04:47:01,832 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 04:47:01,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:47:01,832 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:47:01,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:47:01,833 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:47:01,833 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:47:01,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:47:01,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:47:01,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:47:01,833 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:47:01,834 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:47:01,834 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:47:01,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:47:01,834 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:47:01,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:47:01,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:47:01,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:47:01,835 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:47:01,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:47:01,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:47:01,837 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:47:01,837 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 04:47:01,837 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:47:01,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 04:47:01,837 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_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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 -> b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 [2018-10-27 04:47:01,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:47:01,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:47:01,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:47:01,876 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:47:01,877 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:47:01,877 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-10-27 04:47:01,927 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/data/4e1ccbd17/af3e8e287efb4360a1310fa72991f8b3/FLAG22188f6da [2018-10-27 04:47:02,295 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:47:02,296 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-10-27 04:47:02,300 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/data/4e1ccbd17/af3e8e287efb4360a1310fa72991f8b3/FLAG22188f6da [2018-10-27 04:47:02,311 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/data/4e1ccbd17/af3e8e287efb4360a1310fa72991f8b3 [2018-10-27 04:47:02,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:47:02,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 04:47:02,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:47:02,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:47:02,319 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:47:02,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:47:02" (1/1) ... [2018-10-27 04:47:02,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af8d4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:02, skipping insertion in model container [2018-10-27 04:47:02,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:47:02" (1/1) ... [2018-10-27 04:47:02,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:47:02,347 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:47:02,467 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:47:02,478 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:47:02,492 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:47:02,508 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:47:02,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:02 WrapperNode [2018-10-27 04:47:02,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:47:02,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 04:47:02,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 04:47:02,509 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 04:47:02,516 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:47:02" (1/1) ... [2018-10-27 04:47:02,525 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:47:02" (1/1) ... [2018-10-27 04:47:02,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 04:47:02,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:47:02,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:47:02,557 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:47:02,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:02" (1/1) ... [2018-10-27 04:47:02,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:02" (1/1) ... [2018-10-27 04:47:02,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:02" (1/1) ... [2018-10-27 04:47:02,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:02" (1/1) ... [2018-10-27 04:47:02,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:02" (1/1) ... [2018-10-27 04:47:02,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:02" (1/1) ... [2018-10-27 04:47:02,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:02" (1/1) ... [2018-10-27 04:47:02,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:47:02,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:47:02,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:47:02,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:47:02,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-10-27 04:47:02,744 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-10-27 04:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:47:02,744 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:47:02,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-10-27 04:47:02,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-10-27 04:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-10-27 04:47:02,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-10-27 04:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:47:02,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-10-27 04:47:02,746 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-10-27 04:47:03,581 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:47:03,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:47:03 BoogieIcfgContainer [2018-10-27 04:47:03,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:47:03,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:47:03,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:47:03,586 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:47:03,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:47:02" (1/3) ... [2018-10-27 04:47:03,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479d2851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:47:03, skipping insertion in model container [2018-10-27 04:47:03,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:47:02" (2/3) ... [2018-10-27 04:47:03,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479d2851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:47:03, skipping insertion in model container [2018-10-27 04:47:03,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:47:03" (3/3) ... [2018-10-27 04:47:03,588 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_true-valid-memsafety.c [2018-10-27 04:47:03,605 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:47:03,612 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-10-27 04:47:03,624 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-10-27 04:47:03,647 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:47:03,647 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:47:03,647 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:47:03,647 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:47:03,647 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:47:03,648 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:47:03,648 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:47:03,648 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:47:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-10-27 04:47:03,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-27 04:47:03,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:03,671 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:03,673 INFO L424 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:03,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:03,679 INFO L82 PathProgramCache]: Analyzing trace with hash -122610617, now seen corresponding path program 1 times [2018-10-27 04:47:03,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:03,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:03,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:03,722 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:03,994 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:47:03,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:03,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:47:03,997 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:04,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:47:04,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:47:04,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:47:04,010 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2018-10-27 04:47:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:04,388 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-10-27 04:47:04,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:47:04,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-27 04:47:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:04,399 INFO L225 Difference]: With dead ends: 82 [2018-10-27 04:47:04,400 INFO L226 Difference]: Without dead ends: 77 [2018-10-27 04:47:04,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:47:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-27 04:47:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-10-27 04:47:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-27 04:47:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-10-27 04:47:04,433 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 13 [2018-10-27 04:47:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:04,434 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-10-27 04:47:04,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:47:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-10-27 04:47:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 04:47:04,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:04,435 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:04,435 INFO L424 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:04,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:04,436 INFO L82 PathProgramCache]: Analyzing trace with hash 494038318, now seen corresponding path program 1 times [2018-10-27 04:47:04,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:04,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:04,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:04,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:04,437 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:04,646 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:47:04,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:04,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:47:04,648 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:04,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:04,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:04,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:47:04,650 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 5 states. [2018-10-27 04:47:05,062 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-27 04:47:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:05,293 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-10-27 04:47:05,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:05,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-27 04:47:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:05,295 INFO L225 Difference]: With dead ends: 82 [2018-10-27 04:47:05,295 INFO L226 Difference]: Without dead ends: 82 [2018-10-27 04:47:05,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:05,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-27 04:47:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-10-27 04:47:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-27 04:47:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-10-27 04:47:05,303 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 14 [2018-10-27 04:47:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:05,303 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-10-27 04:47:05,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-10-27 04:47:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 04:47:05,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:05,305 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:05,305 INFO L424 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:05,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:05,306 INFO L82 PathProgramCache]: Analyzing trace with hash -786803888, now seen corresponding path program 1 times [2018-10-27 04:47:05,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:05,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:05,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:05,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:05,307 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:05,825 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-10-27 04:47:05,827 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:05,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:05,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:05,829 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-10-27 04:47:05,830 INFO L202 CegarAbsIntRunner]: [0], [1], [106], [110], [115], [117], [118], [119], [121], [127], [129], [131], [133], [134], [135], [137] [2018-10-27 04:47:05,873 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:05,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:06,825 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:06,826 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 40 variables. [2018-10-27 04:47:06,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:06,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:06,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:06,875 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:06,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:06,895 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:06,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:06,996 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 63 treesize of output 56 [2018-10-27 04:47:07,035 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,043 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 53 treesize of output 63 [2018-10-27 04:47:07,209 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-10-27 04:47:07,214 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,215 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,215 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 48 treesize of output 58 [2018-10-27 04:47:07,300 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,302 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,305 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,309 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,310 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-10-27 04:47:07,475 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-10-27 04:47:07,510 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,513 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,514 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,515 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-10-27 04:47:07,517 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:07,534 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:07,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:07,599 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,600 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,604 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,612 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 50 treesize of output 68 [2018-10-27 04:47:07,703 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,704 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,705 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,707 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,707 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 68 [2018-10-27 04:47:07,748 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,749 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,750 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,751 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,752 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,753 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,753 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-10-27 04:47:07,755 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:07,789 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:07,817 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,818 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,820 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,821 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,822 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,824 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 78 [2018-10-27 04:47:07,909 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,910 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,910 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,912 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,914 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,915 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,915 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,916 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,918 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:07,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2018-10-27 04:47:07,919 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,050 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,053 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,054 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,055 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2018-10-27 04:47:08,056 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,098 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:08,122 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,147 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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:08,177 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:08,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-10-27 04:47:08,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-27 04:47:08,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-10-27 04:47:08,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2018-10-27 04:47:08,200 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,215 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,239 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,285 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,290 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:08,308 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:84, output treesize:36 [2018-10-27 04:47:08,636 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-27 04:47:08,790 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:08,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:09,144 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:09,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:09,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2018-10-27 04:47:09,165 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:09,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:47:09,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:47:09,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:47:09,166 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 11 states. [2018-10-27 04:47:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:09,590 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-10-27 04:47:09,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:47:09,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-27 04:47:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:09,597 INFO L225 Difference]: With dead ends: 87 [2018-10-27 04:47:09,597 INFO L226 Difference]: Without dead ends: 87 [2018-10-27 04:47:09,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:47:09,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-27 04:47:09,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2018-10-27 04:47:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-27 04:47:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-10-27 04:47:09,609 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 19 [2018-10-27 04:47:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:09,609 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-10-27 04:47:09,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:47:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-10-27 04:47:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 04:47:09,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:09,610 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:09,610 INFO L424 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:09,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:09,610 INFO L82 PathProgramCache]: Analyzing trace with hash 41349742, now seen corresponding path program 2 times [2018-10-27 04:47:09,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:09,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:09,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:09,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:09,611 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:09,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:09,904 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:09,904 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:09,904 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:09,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:09,905 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:09,910 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:10,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 04:47:10,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:10,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:10,097 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:10,101 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,103 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,104 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 21 treesize of output 33 [2018-10-27 04:47:10,108 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,109 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,110 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 29 treesize of output 43 [2018-10-27 04:47:10,149 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,152 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-10-27 04:47:10,161 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,167 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,168 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2018-10-27 04:47:10,172 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,189 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,197 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,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,225 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 63 treesize of output 56 [2018-10-27 04:47:10,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,241 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 53 treesize of output 63 [2018-10-27 04:47:10,310 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,311 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,312 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 48 treesize of output 58 [2018-10-27 04:47:10,406 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,407 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,408 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,409 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,409 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-10-27 04:47:10,438 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,438 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,439 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,440 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,440 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,441 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-10-27 04:47:10,442 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,453 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,462 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,498 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,502 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,507 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 50 treesize of output 68 [2018-10-27 04:47:10,562 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,565 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,565 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,567 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 78 [2018-10-27 04:47:10,659 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,662 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,663 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,663 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,664 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,665 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,665 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,667 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2018-10-27 04:47:10,668 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,767 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,803 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,824 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,825 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,828 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,828 INFO L303 Elim1Store]: Index analysis took 129 ms [2018-10-27 04:47:10,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-10-27 04:47:10,829 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,926 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,949 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,950 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,950 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,951 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,952 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 64 [2018-10-27 04:47:10,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,980 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,981 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,985 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,986 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:10,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-10-27 04:47:10,987 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:11,000 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:11,021 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:11,036 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:11,044 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:11,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:11,063 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:84, output treesize:36 [2018-10-27 04:47:11,543 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:11,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:47:12,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:12,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2018-10-27 04:47:12,135 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:12,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 04:47:12,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 04:47:12,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:47:12,136 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 15 states. [2018-10-27 04:47:13,420 WARN L179 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2018-10-27 04:47:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:13,584 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-10-27 04:47:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:47:13,585 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-10-27 04:47:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:13,585 INFO L225 Difference]: With dead ends: 91 [2018-10-27 04:47:13,585 INFO L226 Difference]: Without dead ends: 91 [2018-10-27 04:47:13,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=218, Invalid=594, Unknown=0, NotChecked=0, Total=812 [2018-10-27 04:47:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-27 04:47:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2018-10-27 04:47:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-27 04:47:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-10-27 04:47:13,590 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 24 [2018-10-27 04:47:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:13,591 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-10-27 04:47:13,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 04:47:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-10-27 04:47:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-27 04:47:13,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:13,592 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] [2018-10-27 04:47:13,592 INFO L424 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:13,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:13,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1614813209, now seen corresponding path program 1 times [2018-10-27 04:47:13,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:13,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:13,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 04:47:13,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:13,708 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:13,708 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-10-27 04:47:13,708 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:13,710 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:13,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:14,177 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:14,177 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 40 variables. [2018-10-27 04:47:14,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:14,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:14,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:14,219 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:47:14,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:14,233 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:14,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:14,348 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:14,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:14,422 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:14,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:14,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2018-10-27 04:47:14,450 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:14,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:47:14,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:47:14,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:47:14,450 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 13 states. [2018-10-27 04:47:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:14,939 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-10-27 04:47:14,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 04:47:14,940 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-10-27 04:47:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:14,941 INFO L225 Difference]: With dead ends: 95 [2018-10-27 04:47:14,941 INFO L226 Difference]: Without dead ends: 95 [2018-10-27 04:47:14,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-10-27 04:47:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-27 04:47:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2018-10-27 04:47:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-27 04:47:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-10-27 04:47:14,946 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 34 [2018-10-27 04:47:14,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:14,946 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-10-27 04:47:14,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:47:14,946 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-10-27 04:47:14,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 04:47:14,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:14,949 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:14,950 INFO L424 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:14,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:14,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1779855763, now seen corresponding path program 1 times [2018-10-27 04:47:14,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:14,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:14,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:14,951 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:15,120 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:15,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:15,120 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:15,120 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-10-27 04:47:15,121 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:15,122 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:15,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:15,539 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:15,540 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 40 variables. [2018-10-27 04:47:15,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:15,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:15,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:15,551 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:15,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:15,558 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:15,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:15,675 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:15,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:15,734 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:15,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:15,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-10-27 04:47:15,756 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:15,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:47:15,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:47:15,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:15,757 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 8 states. [2018-10-27 04:47:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:15,774 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-10-27 04:47:15,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:15,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-10-27 04:47:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:15,777 INFO L225 Difference]: With dead ends: 95 [2018-10-27 04:47:15,777 INFO L226 Difference]: Without dead ends: 95 [2018-10-27 04:47:15,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 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:15,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-27 04:47:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-10-27 04:47:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-27 04:47:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-10-27 04:47:15,782 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 40 [2018-10-27 04:47:15,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:15,782 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-10-27 04:47:15,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:47:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-10-27 04:47:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 04:47:15,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:15,791 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] [2018-10-27 04:47:15,791 INFO L424 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:15,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:15,791 INFO L82 PathProgramCache]: Analyzing trace with hash -392024561, now seen corresponding path program 2 times [2018-10-27 04:47:15,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:15,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:15,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:15,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:15,792 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:15,932 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:15,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:15,932 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:15,932 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:15,932 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:15,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:15,932 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:15,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:15,939 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:15,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:15,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:15,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:15,994 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 63 treesize of output 56 [2018-10-27 04:47:16,074 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,079 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 53 treesize of output 63 [2018-10-27 04:47:16,154 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,155 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,156 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 48 treesize of output 58 [2018-10-27 04:47:16,176 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,177 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,178 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,179 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,180 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-10-27 04:47:16,213 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,214 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,217 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,217 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,218 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,219 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-10-27 04:47:16,220 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,233 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,270 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,271 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,274 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,279 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 50 treesize of output 68 [2018-10-27 04:47:16,332 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,333 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,334 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,342 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 68 [2018-10-27 04:47:16,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,371 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,372 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,372 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,373 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,374 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-10-27 04:47:16,375 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,392 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,431 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,432 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,433 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,434 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,435 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,439 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 78 [2018-10-27 04:47:16,510 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,511 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,513 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,514 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,515 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-10-27 04:47:16,516 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,549 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,550 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,551 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,552 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,553 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,554 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,555 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,556 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,557 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,558 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 53 [2018-10-27 04:47:16,559 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,585 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,608 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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:16,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-10-27 04:47:16,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-27 04:47:16,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-10-27 04:47:16,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2018-10-27 04:47:16,667 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,691 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,699 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,705 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,710 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:16,728 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:84, output treesize:36 [2018-10-27 04:47:16,940 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:16,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:17,045 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-10-27 04:47:17,094 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:47:17,390 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-10-27 04:47:17,580 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:17,608 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:17,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 18 [2018-10-27 04:47:17,609 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:17,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:17,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:17,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:47:17,610 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 7 states. [2018-10-27 04:47:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:18,844 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-10-27 04:47:18,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:18,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-10-27 04:47:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:18,846 INFO L225 Difference]: With dead ends: 96 [2018-10-27 04:47:18,846 INFO L226 Difference]: Without dead ends: 96 [2018-10-27 04:47:18,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-10-27 04:47:18,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-27 04:47:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-10-27 04:47:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-27 04:47:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-10-27 04:47:18,850 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 45 [2018-10-27 04:47:18,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:18,851 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-10-27 04:47:18,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-10-27 04:47:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 04:47:18,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:18,852 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:18,852 INFO L424 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:18,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:18,852 INFO L82 PathProgramCache]: Analyzing trace with hash 732140571, now seen corresponding path program 1 times [2018-10-27 04:47:18,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:18,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:18,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:18,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:18,853 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:18,933 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:18,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:18,933 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:18,933 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-10-27 04:47:18,933 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:18,935 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:18,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:19,273 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:19,274 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 45 variables. [2018-10-27 04:47:19,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:19,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:19,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:19,276 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:19,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:19,282 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:19,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:19,323 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:19,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:19,853 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:19,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:19,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-10-27 04:47:19,869 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:19,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:47:19,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:47:19,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:19,870 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 9 states. [2018-10-27 04:47:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:19,893 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-10-27 04:47:19,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:47:19,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-10-27 04:47:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:19,896 INFO L225 Difference]: With dead ends: 99 [2018-10-27 04:47:19,896 INFO L226 Difference]: Without dead ends: 99 [2018-10-27 04:47:19,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-27 04:47:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-10-27 04:47:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-27 04:47:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-10-27 04:47:19,902 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 46 [2018-10-27 04:47:19,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:19,903 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-10-27 04:47:19,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:47:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-10-27 04:47:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 04:47:19,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:19,904 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] [2018-10-27 04:47:19,905 INFO L424 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:19,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:19,905 INFO L82 PathProgramCache]: Analyzing trace with hash 215642685, now seen corresponding path program 2 times [2018-10-27 04:47:19,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:19,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:19,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:19,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:19,906 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:20,026 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:20,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:20,027 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:20,027 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:20,027 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:20,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:20,027 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:20,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:20,033 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:20,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:20,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:20,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:20,063 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 39 treesize of output 38 [2018-10-27 04:47:20,068 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,075 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 38 treesize of output 41 [2018-10-27 04:47:20,077 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,080 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2018-10-27 04:47:20,138 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,139 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,141 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,142 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 39 treesize of output 59 [2018-10-27 04:47:20,145 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 0 case distinctions, treesize of input 36 treesize of output 50 [2018-10-27 04:47:20,151 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 27 treesize of output 42 [2018-10-27 04:47:20,152 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:20,161 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:20,171 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:20,192 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,193 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,196 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,197 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,205 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 37 treesize of output 65 [2018-10-27 04:47:20,216 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 60 [2018-10-27 04:47:20,219 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,227 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,231 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 56 treesize of output 63 [2018-10-27 04:47:20,232 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:20,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 49 [2018-10-27 04:47:20,288 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:20,332 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:20,415 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,416 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,417 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,418 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,419 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 0 case distinctions, treesize of input 41 treesize of output 64 [2018-10-27 04:47:20,424 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 33 treesize of output 50 [2018-10-27 04:47:20,425 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:20,438 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:20,487 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:47:20,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:47:20,619 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 35 treesize of output 34 [2018-10-27 04:47:20,629 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,630 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,633 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:20,634 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 28 treesize of output 48 [2018-10-27 04:47:20,646 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2018-10-27 04:47:20,719 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 27 treesize of output 38 [2018-10-27 04:47:20,719 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:20,734 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:20,742 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:20,779 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:20,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:47:20,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:47:21,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-10-27 04:47:21,000 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:39, output treesize:237 [2018-10-27 04:47:21,168 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:21,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:21,213 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:21,229 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:21,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 13 [2018-10-27 04:47:21,229 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:21,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:47:21,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:47:21,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:21,230 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 4 states. [2018-10-27 04:47:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:21,386 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-10-27 04:47:21,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:47:21,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-10-27 04:47:21,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:21,388 INFO L225 Difference]: With dead ends: 102 [2018-10-27 04:47:21,388 INFO L226 Difference]: Without dead ends: 102 [2018-10-27 04:47:21,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:47:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-27 04:47:21,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2018-10-27 04:47:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-27 04:47:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-10-27 04:47:21,392 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 51 [2018-10-27 04:47:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:21,392 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-10-27 04:47:21,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:47:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-10-27 04:47:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 04:47:21,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:21,393 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:21,394 INFO L424 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:21,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:21,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1905011281, now seen corresponding path program 1 times [2018-10-27 04:47:21,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:21,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:21,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:21,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:21,395 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:21,516 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:21,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:21,517 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:21,517 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-10-27 04:47:21,517 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:21,518 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:21,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:21,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:21,871 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 45 variables. [2018-10-27 04:47:21,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:21,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:21,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:21,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:21,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:21,879 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:21,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:21,916 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:21,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:21,974 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:21,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:21,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-10-27 04:47:21,990 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:21,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:47:21,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:47:21,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:21,990 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 10 states. [2018-10-27 04:47:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:22,012 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-10-27 04:47:22,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:47:22,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-10-27 04:47:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:22,014 INFO L225 Difference]: With dead ends: 103 [2018-10-27 04:47:22,014 INFO L226 Difference]: Without dead ends: 103 [2018-10-27 04:47:22,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 97 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:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-27 04:47:22,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-10-27 04:47:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-27 04:47:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-10-27 04:47:22,017 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 52 [2018-10-27 04:47:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:22,017 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-10-27 04:47:22,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:47:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-10-27 04:47:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-27 04:47:22,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:22,018 INFO L375 BasicCegarLoop]: trace histogram [8, 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] [2018-10-27 04:47:22,018 INFO L424 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:22,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:22,019 INFO L82 PathProgramCache]: Analyzing trace with hash -585100719, now seen corresponding path program 2 times [2018-10-27 04:47:22,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:22,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:22,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:22,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:22,024 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:47:22,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:22,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:22,236 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:22,236 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:22,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:22,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:22,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:22,244 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:22,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:22,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:22,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:22,292 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 38 treesize of output 37 [2018-10-27 04:47:22,355 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,376 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 37 treesize of output 40 [2018-10-27 04:47:22,378 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,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 36 treesize of output 43 [2018-10-27 04:47:22,433 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,434 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,436 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,438 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,440 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,448 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 36 treesize of output 64 [2018-10-27 04:47:22,497 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,498 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,500 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,501 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,501 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,503 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2018-10-27 04:47:22,504 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,531 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,532 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,533 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,535 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,536 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,539 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,541 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,541 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,542 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2018-10-27 04:47:22,543 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,565 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,593 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,594 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,597 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,598 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 35 treesize of output 51 [2018-10-27 04:47:22,620 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,621 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,621 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,622 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,623 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,624 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,628 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 26 treesize of output 29 [2018-10-27 04:47:22,628 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,637 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,667 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,685 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 31 treesize of output 30 [2018-10-27 04:47:22,735 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,736 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,740 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,740 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 27 treesize of output 47 [2018-10-27 04:47:22,757 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,763 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,764 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,765 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,768 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-10-27 04:47:22,769 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,777 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,785 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,800 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,808 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,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 [2018-10-27 04:47:22,823 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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:22,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:22,880 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 0 case distinctions, treesize of input 20 treesize of output 30 [2018-10-27 04:47:22,899 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2018-10-27 04:47:22,900 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,908 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,913 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,926 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,928 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 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:22,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-10-27 04:47:22,950 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 22 treesize of output 45 [2018-10-27 04:47:22,951 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,963 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,978 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,980 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 55 [2018-10-27 04:47:22,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 70 [2018-10-27 04:47:22,986 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:23,000 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:23,015 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:23,035 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:23,054 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:23,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:23,084 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 7 variables, input treesize:59, output treesize:60 [2018-10-27 04:47:23,447 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-27 04:47:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-27 04:47:23,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-27 04:47:23,722 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:23,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 18 [2018-10-27 04:47:23,723 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:23,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:23,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:23,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:47:23,723 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 6 states. [2018-10-27 04:47:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:24,101 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-10-27 04:47:24,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:24,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-10-27 04:47:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:24,103 INFO L225 Difference]: With dead ends: 103 [2018-10-27 04:47:24,103 INFO L226 Difference]: Without dead ends: 103 [2018-10-27 04:47:24,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:47:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-27 04:47:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-10-27 04:47:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-27 04:47:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-10-27 04:47:24,106 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 57 [2018-10-27 04:47:24,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:24,107 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-10-27 04:47:24,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:24,107 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-10-27 04:47:24,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-27 04:47:24,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:24,108 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:24,108 INFO L424 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:24,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:24,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1635173283, now seen corresponding path program 1 times [2018-10-27 04:47:24,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:24,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:24,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:24,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:24,109 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-27 04:47:24,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:24,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:47:24,581 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:24,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:47:24,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:47:24,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:47:24,582 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 9 states. [2018-10-27 04:47:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:24,946 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-10-27 04:47:24,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:47:24,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-10-27 04:47:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:24,948 INFO L225 Difference]: With dead ends: 107 [2018-10-27 04:47:24,948 INFO L226 Difference]: Without dead ends: 107 [2018-10-27 04:47:24,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-27 04:47:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2018-10-27 04:47:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-27 04:47:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-10-27 04:47:24,951 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 67 [2018-10-27 04:47:24,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:24,951 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-10-27 04:47:24,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:47:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-10-27 04:47:24,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-27 04:47:24,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:24,954 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:24,954 INFO L424 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:24,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:24,955 INFO L82 PathProgramCache]: Analyzing trace with hash -849235733, now seen corresponding path program 1 times [2018-10-27 04:47:24,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:24,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:24,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:24,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:24,955 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:25,080 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:25,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:25,081 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:25,081 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-10-27 04:47:25,081 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:25,085 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:25,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:26,264 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:26,264 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 48 variables. [2018-10-27 04:47:26,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:26,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:26,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:26,303 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:47:26,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:26,317 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:26,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:26,453 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:26,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:26,544 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:26,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:26,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-10-27 04:47:26,560 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:26,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:47:26,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:47:26,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:26,561 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 11 states. [2018-10-27 04:47:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:26,580 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-10-27 04:47:26,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:47:26,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-10-27 04:47:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:26,581 INFO L225 Difference]: With dead ends: 108 [2018-10-27 04:47:26,581 INFO L226 Difference]: Without dead ends: 108 [2018-10-27 04:47:26,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 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:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-27 04:47:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2018-10-27 04:47:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-27 04:47:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-10-27 04:47:26,584 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 68 [2018-10-27 04:47:26,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:26,584 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-10-27 04:47:26,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:47:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-10-27 04:47:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-27 04:47:26,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:26,586 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:26,586 INFO L424 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:26,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:26,586 INFO L82 PathProgramCache]: Analyzing trace with hash 529820045, now seen corresponding path program 2 times [2018-10-27 04:47:26,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:26,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:26,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:26,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:26,592 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:27,042 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:27,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:27,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:27,042 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:27,042 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:27,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:27,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:27,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:27,049 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:27,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:27,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:27,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:27,074 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 38 treesize of output 37 [2018-10-27 04:47:27,078 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,083 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 37 treesize of output 40 [2018-10-27 04:47:27,086 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 34 treesize of output 33 [2018-10-27 04:47:27,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,099 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,099 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 27 treesize of output 47 [2018-10-27 04:47:27,116 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,117 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,118 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,118 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,119 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,122 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2018-10-27 04:47:27,123 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,134 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,161 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,168 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 43 [2018-10-27 04:47:27,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,202 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,204 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,206 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,208 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,237 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 36 treesize of output 64 [2018-10-27 04:47:27,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,287 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,288 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,289 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,290 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,290 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,292 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2018-10-27 04:47:27,293 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,348 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,349 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,350 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,351 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,352 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,356 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,358 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2018-10-27 04:47:27,360 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,381 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,491 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,492 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,495 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,496 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 35 treesize of output 51 [2018-10-27 04:47:27,545 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,546 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,547 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,548 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,548 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,549 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,552 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,553 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 26 treesize of output 29 [2018-10-27 04:47:27,553 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,562 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,579 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 [2018-10-27 04:47:27,649 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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:27,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:27,659 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 0 case distinctions, treesize of input 20 treesize of output 30 [2018-10-27 04:47:27,689 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2018-10-27 04:47:27,689 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,698 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,703 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,715 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,717 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 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:27,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-10-27 04:47:27,839 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 22 treesize of output 45 [2018-10-27 04:47:27,840 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,921 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,935 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,936 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,937 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:27,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 55 [2018-10-27 04:47:27,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 70 [2018-10-27 04:47:27,947 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,961 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:27,975 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:27,995 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:28,014 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:28,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:28,056 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 7 variables, input treesize:59, output treesize:60 [2018-10-27 04:47:28,188 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,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:28,299 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-10-27 04:47:28,340 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:47:28,369 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:47:28,675 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 04:47:28,747 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,763 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:28,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [11] total 21 [2018-10-27 04:47:28,763 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:28,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:28,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:28,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-10-27 04:47:28,764 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 7 states. [2018-10-27 04:47:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:29,212 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-10-27 04:47:29,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:29,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-10-27 04:47:29,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:29,213 INFO L225 Difference]: With dead ends: 109 [2018-10-27 04:47:29,213 INFO L226 Difference]: Without dead ends: 109 [2018-10-27 04:47:29,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2018-10-27 04:47:29,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-27 04:47:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-10-27 04:47:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-27 04:47:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-10-27 04:47:29,216 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 73 [2018-10-27 04:47:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:29,216 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-10-27 04:47:29,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-10-27 04:47:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-27 04:47:29,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:29,217 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:29,217 INFO L424 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:29,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:29,218 INFO L82 PathProgramCache]: Analyzing trace with hash -755447741, now seen corresponding path program 1 times [2018-10-27 04:47:29,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:29,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:29,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:29,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:29,219 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:29,348 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:29,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:29,348 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:29,348 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 75 with the following transitions: [2018-10-27 04:47:29,349 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [7], [12], [14], [16], [17], [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:29,350 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:29,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:30,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:30,446 INFO L272 AbstractInterpreter]: Visited 37 different actions 149 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:30,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:30,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:30,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:30,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:30,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:30,462 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:30,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:30,518 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,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:30,631 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,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:30,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-10-27 04:47:30,659 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:30,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:47:30,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:47:30,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:30,660 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 12 states. [2018-10-27 04:47:30,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:30,725 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-10-27 04:47:30,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:47:30,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2018-10-27 04:47:30,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:30,728 INFO L225 Difference]: With dead ends: 112 [2018-10-27 04:47:30,728 INFO L226 Difference]: Without dead ends: 112 [2018-10-27 04:47:30,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 139 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-27 04:47:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-10-27 04:47:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-27 04:47:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-10-27 04:47:30,732 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 74 [2018-10-27 04:47:30,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:30,733 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-10-27 04:47:30,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:47:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-10-27 04:47:30,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-27 04:47:30,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:30,737 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] [2018-10-27 04:47:30,737 INFO L424 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:30,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:30,738 INFO L82 PathProgramCache]: Analyzing trace with hash 737345381, now seen corresponding path program 2 times [2018-10-27 04:47:30,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:30,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:30,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:30,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:30,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:30,915 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,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:30,915 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:30,915 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:30,915 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,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:30,915 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:30,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:30,924 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:30,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:30,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:30,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:30,950 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 21 treesize of output 24 [2018-10-27 04:47:30,952 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:30,956 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 24 treesize of output 30 [2018-10-27 04:47:30,958 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:30,960 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:30,965 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 26 treesize of output 36 [2018-10-27 04:47:30,968 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:30,970 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:30,975 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 32 treesize of output 42 [2018-10-27 04:47:30,980 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:30,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:30,989 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2018-10-27 04:47:30,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 53 [2018-10-27 04:47:30,995 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,025 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:31,028 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:31,030 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:31,031 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:31,033 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:31,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-10-27 04:47:31,038 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:31,073 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:31,114 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2018-10-27 04:47:31,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2018-10-27 04:47:31,121 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,131 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,167 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:47:31,211 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 30 treesize of output 36 [2018-10-27 04:47:31,217 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-10-27 04:47:31,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-10-27 04:47:31,224 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,230 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,238 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 04:47:31,329 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 24 treesize of output 26 [2018-10-27 04:47:31,333 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 23 treesize of output 25 [2018-10-27 04:47:31,343 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-10-27 04:47:31,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-10-27 04:47:31,352 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,358 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,363 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,371 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,418 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:47:31,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 04:47:31,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-10-27 04:47:31,506 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:21, output treesize:165 [2018-10-27 04:47:31,715 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:31,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:31,809 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:31,824 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:31,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [12] total 16 [2018-10-27 04:47:31,825 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:31,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:47:31,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:47:31,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:47:31,825 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 4 states. [2018-10-27 04:47:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:31,958 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-10-27 04:47:31,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:47:31,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-10-27 04:47:31,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:31,962 INFO L225 Difference]: With dead ends: 115 [2018-10-27 04:47:31,962 INFO L226 Difference]: Without dead ends: 115 [2018-10-27 04:47:31,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:47:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-27 04:47:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2018-10-27 04:47:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-27 04:47:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-10-27 04:47:31,964 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 79 [2018-10-27 04:47:31,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:31,965 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-10-27 04:47:31,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:47:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-10-27 04:47:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-27 04:47:31,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:31,966 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:31,966 INFO L424 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:31,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1382870381, now seen corresponding path program 1 times [2018-10-27 04:47:31,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:31,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:31,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:31,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:31,967 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:32,094 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:32,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:32,094 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:32,095 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-10-27 04:47:32,095 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:32,096 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:32,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:33,263 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:33,264 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:33,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:33,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:33,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:33,302 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:47:33,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:33,316 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:33,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:33,406 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:33,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:33,476 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:33,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:33,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-10-27 04:47:33,492 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:33,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:47:33,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:47:33,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:33,493 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 13 states. [2018-10-27 04:47:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:33,521 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-10-27 04:47:33,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:47:33,522 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-10-27 04:47:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:33,523 INFO L225 Difference]: With dead ends: 113 [2018-10-27 04:47:33,523 INFO L226 Difference]: Without dead ends: 113 [2018-10-27 04:47:33,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 150 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-27 04:47:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-10-27 04:47:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-27 04:47:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-10-27 04:47:33,525 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 80 [2018-10-27 04:47:33,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:33,526 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-10-27 04:47:33,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:47:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-10-27 04:47:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-27 04:47:33,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:33,527 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 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:33,527 INFO L424 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:33,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:33,527 INFO L82 PathProgramCache]: Analyzing trace with hash 87409423, now seen corresponding path program 2 times [2018-10-27 04:47:33,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:33,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:33,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:33,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:33,528 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-27 04:47:33,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:33,685 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:33,685 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:33,685 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:33,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:33,685 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:33,693 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:33,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:33,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:33,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:33,726 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:33,743 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,763 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:33,765 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,768 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,773 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:33,779 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,782 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,787 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:33,792 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,794 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,795 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,797 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 52 [2018-10-27 04:47:33,797 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:33,823 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,825 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,825 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,828 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,829 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2018-10-27 04:47:33,834 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:33,870 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:33,897 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:33,900 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,901 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,902 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,904 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 0 case distinctions, treesize of input 22 treesize of output 37 [2018-10-27 04:47:33,904 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:33,914 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:33,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:33,966 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:33,969 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:33,973 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,974 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,975 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:33,977 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-10-27 04:47:33,978 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:33,985 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:33,990 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,017 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:47:34,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:47:34,074 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 20 treesize of output 23 [2018-10-27 04:47:34,077 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,081 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 23 treesize of output 29 [2018-10-27 04:47:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-10-27 04:47:34,088 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 22 treesize of output 24 [2018-10-27 04:47:34,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,096 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,097 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,099 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,100 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 21 treesize of output 20 [2018-10-27 04:47:34,100 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,106 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,111 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,123 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,125 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,129 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 25 treesize of output 35 [2018-10-27 04:47:34,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,135 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,193 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 31 treesize of output 41 [2018-10-27 04:47:34,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,229 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,230 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,232 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 36 treesize of output 40 [2018-10-27 04:47:34,232 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,270 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,270 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,271 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,274 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,276 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,277 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-10-27 04:47:34,278 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,296 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:34,317 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 26 treesize of output 28 [2018-10-27 04:47:34,325 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,325 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,326 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,329 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,329 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 21 treesize of output 13 [2018-10-27 04:47:34,330 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,335 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,345 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,355 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,359 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:34,390 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:42, output treesize:44 [2018-10-27 04:47:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 04:47:34,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 04:47:34,627 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:34,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 12 [2018-10-27 04:47:34,628 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:34,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:34,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:47:34,628 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 6 states. [2018-10-27 04:47:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:34,776 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-10-27 04:47:34,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:34,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-10-27 04:47:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:34,778 INFO L225 Difference]: With dead ends: 116 [2018-10-27 04:47:34,778 INFO L226 Difference]: Without dead ends: 116 [2018-10-27 04:47:34,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:47:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-27 04:47:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-10-27 04:47:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-27 04:47:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2018-10-27 04:47:34,781 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 85 [2018-10-27 04:47:34,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:34,781 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2018-10-27 04:47:34,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2018-10-27 04:47:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-27 04:47:34,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:34,782 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,782 INFO L424 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:34,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:34,782 INFO L82 PathProgramCache]: Analyzing trace with hash -113863873, now seen corresponding path program 1 times [2018-10-27 04:47:34,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:34,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:34,783 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 04:47:34,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:34,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:47:34,983 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:34,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:47:34,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:47:34,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:47:34,984 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand 8 states. [2018-10-27 04:47:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:35,342 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-10-27 04:47:35,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:47:35,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-10-27 04:47:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:35,343 INFO L225 Difference]: With dead ends: 120 [2018-10-27 04:47:35,344 INFO L226 Difference]: Without dead ends: 120 [2018-10-27 04:47:35,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-27 04:47:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2018-10-27 04:47:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-27 04:47:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-10-27 04:47:35,346 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 95 [2018-10-27 04:47:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:35,347 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-10-27 04:47:35,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:47:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-10-27 04:47:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 04:47:35,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:35,348 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, 1] [2018-10-27 04:47:35,348 INFO L424 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:35,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:35,348 INFO L82 PathProgramCache]: Analyzing trace with hash 765187331, now seen corresponding path program 1 times [2018-10-27 04:47:35,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:35,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:35,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:35,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:35,349 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:35,505 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:35,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:35,506 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:35,506 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 97 with the following transitions: [2018-10-27 04:47:35,506 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], [66], [67], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [128], [129], [130], [131], [132], [133], [134], [135], [137] [2018-10-27 04:47:35,508 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:35,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:37,417 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:37,418 INFO L272 AbstractInterpreter]: Visited 48 different actions 224 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 48 variables. [2018-10-27 04:47:37,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:37,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:37,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:37,463 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:37,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:37,480 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:37,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:37,636 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:37,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:38,072 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:38,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:38,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-10-27 04:47:38,088 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:38,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:47:38,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:47:38,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:38,089 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 5 states. [2018-10-27 04:47:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:38,101 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-10-27 04:47:38,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:47:38,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-10-27 04:47:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:38,103 INFO L225 Difference]: With dead ends: 125 [2018-10-27 04:47:38,103 INFO L226 Difference]: Without dead ends: 125 [2018-10-27 04:47:38,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-27 04:47:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2018-10-27 04:47:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-27 04:47:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2018-10-27 04:47:38,106 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 96 [2018-10-27 04:47:38,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:38,106 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2018-10-27 04:47:38,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:47:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2018-10-27 04:47:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-27 04:47:38,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:38,107 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, 1] [2018-10-27 04:47:38,107 INFO L424 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:38,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:38,108 INFO L82 PathProgramCache]: Analyzing trace with hash -863102084, now seen corresponding path program 2 times [2018-10-27 04:47:38,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:38,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:38,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:38,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:38,108 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:38,407 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:38,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:38,408 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:38,408 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:38,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:38,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:38,408 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:38,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:38,426 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:38,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:38,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:38,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:38,491 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:38,510 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,516 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:38,518 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:38,522 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:38,525 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,526 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,527 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,530 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-10-27 04:47:38,530 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:38,537 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:38,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:38,555 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,558 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,563 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:38,566 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:38,569 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,571 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,574 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 0 case distinctions, treesize of input 22 treesize of output 37 [2018-10-27 04:47:38,574 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:38,589 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:38,605 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,609 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,614 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 25 treesize of output 39 [2018-10-27 04:47:38,616 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,618 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,619 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,621 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 52 [2018-10-27 04:47:38,622 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:38,650 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,652 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,653 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,654 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,655 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,656 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,782 INFO L303 Elim1Store]: Index analysis took 133 ms [2018-10-27 04:47:38,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2018-10-27 04:47:38,783 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:38,808 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:38,830 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:38,857 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:47:38,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:47:38,910 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 20 treesize of output 23 [2018-10-27 04:47:38,914 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,918 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 23 treesize of output 29 [2018-10-27 04:47:38,921 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 23 treesize of output 25 [2018-10-27 04:47:38,926 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 22 treesize of output 24 [2018-10-27 04:47:38,933 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,934 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,935 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,937 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,938 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 21 treesize of output 20 [2018-10-27 04:47:38,938 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:38,944 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:38,949 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:38,961 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,963 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,967 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 25 treesize of output 35 [2018-10-27 04:47:38,971 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,973 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:38,977 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 31 treesize of output 41 [2018-10-27 04:47:39,012 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,014 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,017 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,018 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,019 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,020 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-10-27 04:47:39,021 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:39,041 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,042 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,043 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,045 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,046 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 33 treesize of output 25 [2018-10-27 04:47:39,046 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:39,059 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:39,076 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 26 treesize of output 28 [2018-10-27 04:47:39,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,085 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,086 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,088 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:39,089 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 21 treesize of output 13 [2018-10-27 04:47:39,089 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:39,094 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:39,105 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:39,114 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:39,119 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:39,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:39,149 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:42, output treesize:44 [2018-10-27 04:47:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-10-27 04:47:39,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:39,288 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-10-27 04:47:39,346 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:47:39,369 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-10-27 04:47:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-10-27 04:47:39,474 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:39,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [5] total 15 [2018-10-27 04:47:39,475 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:39,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:39,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:39,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:47:39,475 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand 7 states. [2018-10-27 04:47:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:39,789 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2018-10-27 04:47:39,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:39,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-10-27 04:47:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:39,791 INFO L225 Difference]: With dead ends: 124 [2018-10-27 04:47:39,791 INFO L226 Difference]: Without dead ends: 124 [2018-10-27 04:47:39,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:47:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-27 04:47:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2018-10-27 04:47:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-27 04:47:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-10-27 04:47:39,794 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 103 [2018-10-27 04:47:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:39,794 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-10-27 04:47:39,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-10-27 04:47:39,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 04:47:39,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:39,795 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, 1, 1] [2018-10-27 04:47:39,799 INFO L424 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:39,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:39,799 INFO L82 PathProgramCache]: Analyzing trace with hash -986360728, now seen corresponding path program 1 times [2018-10-27 04:47:39,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:39,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:39,800 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:39,916 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-10-27 04:47:39,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:39,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:47:39,916 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:39,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:47:39,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:47:39,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:47:39,917 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 4 states. [2018-10-27 04:47:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:40,009 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-10-27 04:47:40,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:47:40,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-10-27 04:47:40,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:40,012 INFO L225 Difference]: With dead ends: 125 [2018-10-27 04:47:40,012 INFO L226 Difference]: Without dead ends: 125 [2018-10-27 04:47:40,012 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:40,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-27 04:47:40,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 118. [2018-10-27 04:47:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-27 04:47:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2018-10-27 04:47:40,015 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 104 [2018-10-27 04:47:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:40,015 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2018-10-27 04:47:40,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:47:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2018-10-27 04:47:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-27 04:47:40,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:40,016 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, 1, 1, 1] [2018-10-27 04:47:40,016 INFO L424 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:40,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:40,016 INFO L82 PathProgramCache]: Analyzing trace with hash -512411394, now seen corresponding path program 1 times [2018-10-27 04:47:40,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:40,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:40,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:40,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:40,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:40,119 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:40,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:40,119 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:40,119 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2018-10-27 04:47:40,120 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], [66], [68], [70], [71], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [128], [129], [130], [131], [132], [133], [134], [135], [137] [2018-10-27 04:47:40,121 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:40,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:41,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:41,873 INFO L272 AbstractInterpreter]: Visited 50 different actions 226 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 48 variables. [2018-10-27 04:47:41,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:41,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:41,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:41,895 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:41,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:41,904 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:41,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:41,958 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:41,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:42,013 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:42,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:42,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-10-27 04:47:42,029 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:42,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:42,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:47:42,030 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand 6 states. [2018-10-27 04:47:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:42,044 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-10-27 04:47:42,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:47:42,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-10-27 04:47:42,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:42,046 INFO L225 Difference]: With dead ends: 130 [2018-10-27 04:47:42,046 INFO L226 Difference]: Without dead ends: 130 [2018-10-27 04:47:42,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:47:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-27 04:47:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-10-27 04:47:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-27 04:47:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-10-27 04:47:42,049 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 105 [2018-10-27 04:47:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:42,049 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-10-27 04:47:42,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-10-27 04:47:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 04:47:42,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:42,050 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, 1, 1, 1] [2018-10-27 04:47:42,050 INFO L424 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:42,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:42,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2120755877, now seen corresponding path program 2 times [2018-10-27 04:47:42,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:42,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:42,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:42,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:42,051 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:42,437 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:42,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:42,437 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:42,437 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:42,437 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,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:42,437 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:42,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:42,444 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:42,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:42,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:42,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:42,487 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:42,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:42,491 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:42,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-27 04:47:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-10-27 04:47:42,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-10-27 04:47:42,657 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:42,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 14 [2018-10-27 04:47:42,658 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:42,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:47:42,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:47:42,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:47:42,658 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 6 states. [2018-10-27 04:47:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:42,823 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-10-27 04:47:42,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:42,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-10-27 04:47:42,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:42,825 INFO L225 Difference]: With dead ends: 128 [2018-10-27 04:47:42,826 INFO L226 Difference]: Without dead ends: 128 [2018-10-27 04:47:42,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:47:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-27 04:47:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-10-27 04:47:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-27 04:47:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2018-10-27 04:47:42,828 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 112 [2018-10-27 04:47:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:42,829 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2018-10-27 04:47:42,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:47:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-10-27 04:47:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-27 04:47:42,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:42,829 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-10-27 04:47:42,830 INFO L424 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:42,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:42,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1279643879, now seen corresponding path program 1 times [2018-10-27 04:47:42,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:42,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:42,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:42,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:42,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-10-27 04:47:42,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:42,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:47:42,950 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:42,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:42,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:42,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:47:42,951 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand 7 states. [2018-10-27 04:47:43,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:43,173 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-10-27 04:47:43,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:43,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-10-27 04:47:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:43,175 INFO L225 Difference]: With dead ends: 127 [2018-10-27 04:47:43,175 INFO L226 Difference]: Without dead ends: 127 [2018-10-27 04:47:43,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-27 04:47:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-10-27 04:47:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-27 04:47:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-10-27 04:47:43,178 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 122 [2018-10-27 04:47:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:43,178 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-10-27 04:47:43,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:43,178 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-10-27 04:47:43,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-27 04:47:43,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:43,179 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:43,187 INFO L424 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:43,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:43,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1014254712, now seen corresponding path program 1 times [2018-10-27 04:47:43,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:43,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:43,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:43,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:43,188 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-10-27 04:47:43,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:43,293 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:43,293 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-10-27 04:47:43,294 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], [62], [64], [66], [68], [70], [72], [74], [78], [79], [84], [88], [93], [95], [96], [106], [110], [113], [115], [117], [119], [121], [125], [126], [127], [128], [129], [130], [131], [132], [133], [134], [135], [137], [138] [2018-10-27 04:47:43,296 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:47:43,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:47:45,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:47:45,476 INFO L272 AbstractInterpreter]: Visited 60 different actions 300 times. Merged at 26 different actions 208 times. Widened at 4 different actions 16 times. Found 4 fixpoints after 4 different actions. Largest state had 48 variables. [2018-10-27 04:47:45,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:45,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:47:45,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:45,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:45,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:45,491 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:47:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:45,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-10-27 04:47:45,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-10-27 04:47:45,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:47:45,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-10-27 04:47:45,607 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:47:45,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:45,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:45,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:47:45,608 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 7 states. [2018-10-27 04:47:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:45,628 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-10-27 04:47:45,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:47:45,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2018-10-27 04:47:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:45,630 INFO L225 Difference]: With dead ends: 137 [2018-10-27 04:47:45,630 INFO L226 Difference]: Without dead ends: 137 [2018-10-27 04:47:45,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 242 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:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-27 04:47:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2018-10-27 04:47:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-27 04:47:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2018-10-27 04:47:45,633 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 123 [2018-10-27 04:47:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:45,633 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2018-10-27 04:47:45,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-10-27 04:47:45,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-27 04:47:45,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:45,634 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:45,634 INFO L424 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-27 04:47:45,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:45,634 INFO L82 PathProgramCache]: Analyzing trace with hash -787299745, now seen corresponding path program 2 times [2018-10-27 04:47:45,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:47:45,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:45,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:45,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:45,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:47:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-10-27 04:47:45,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:45,995 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:47:45,995 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:47:45,995 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:45,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:45,996 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/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:46,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:47:46,004 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:47:46,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:47:46,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:46,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:46,031 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:46,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:46,036 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:46,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-27 04:47:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2018-10-27 04:47:46,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:47:46,326 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 04:47:46,370 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-10-27 04:47:46,386 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-10-27 04:47:46,473 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-10-27 04:47:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2018-10-27 04:47:46,560 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:47:46,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2018-10-27 04:47:46,560 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:47:46,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:47:46,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:47:46,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:47:46,561 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand 7 states. [2018-10-27 04:47:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:47,233 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-10-27 04:47:47,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:47:47,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-10-27 04:47:47,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:47,234 INFO L225 Difference]: With dead ends: 133 [2018-10-27 04:47:47,235 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 04:47:47,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:47:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 04:47:47,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 04:47:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 04:47:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 04:47:47,235 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 130 [2018-10-27 04:47:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:47,235 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 04:47:47,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:47:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 04:47:47,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 04:47:47,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:47:47 BoogieIcfgContainer [2018-10-27 04:47:47,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:47:47,240 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 04:47:47,240 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 04:47:47,240 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 04:47:47,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:47:03" (3/4) ... [2018-10-27 04:47:47,247 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 04:47:47,254 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 04:47:47,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2018-10-27 04:47:47,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2018-10-27 04:47:47,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2018-10-27 04:47:47,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 04:47:47,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2018-10-27 04:47:47,266 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 157 nodes and edges [2018-10-27 04:47:47,267 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2018-10-27 04:47:47,267 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 50 nodes and edges [2018-10-27 04:47:47,267 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-10-27 04:47:47,307 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5d54facd-a53b-4d5a-9fe0-eb740bee7b4d/bin-2019/utaipan/witness.graphml [2018-10-27 04:47:47,307 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 04:47:47,307 INFO L168 Benchmark]: Toolchain (without parser) took 44993.19 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 954.8 MB in the beginning and 1.3 GB in the end (delta: -334.4 MB). Peak memory consumption was 883.0 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:47,308 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:47:47,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 192.52 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 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:47:47,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.27 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 938.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:47,308 INFO L168 Benchmark]: Boogie Preprocessor took 46.09 ms. Allocated memory is still 1.0 GB. Free memory is still 938.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:47:47,309 INFO L168 Benchmark]: RCFGBuilder took 978.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:47,309 INFO L168 Benchmark]: TraceAbstraction took 43657.08 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -179.6 MB). Peak memory consumption was 843.8 MB. Max. memory is 11.5 GB. [2018-10-27 04:47:47,309 INFO L168 Benchmark]: Witness Printer took 66.95 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.5 kB). Peak memory consumption was 2.5 kB. Max. memory is 11.5 GB. [2018-10-27 04:47:47,310 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.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 192.52 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 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 48.27 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 938.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.09 ms. Allocated memory is still 1.0 GB. Free memory is still 938.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 978.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43657.08 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -179.6 MB). Peak memory consumption was 843.8 MB. Max. memory is 11.5 GB. * Witness Printer took 66.95 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.5 kB). Peak memory consumption was 2.5 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 79 locations, 17 error locations. SAFE Result, 43.6s OverallTime, 27 OverallIterations, 11 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1558 SDtfs, 1493 SDslu, 5478 SDs, 0 SdLazy, 2454 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3233 GetRequests, 2851 SyntacticMatches, 40 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 12.1s AbstIntTime, 11 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 121 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 3407 NumberOfCodeBlocks, 2915 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 4834 ConstructedInterpolants, 338 QuantifiedInterpolants, 1904303 SizeOfPredicates, 143 NumberOfNonLiveVariables, 5653 ConjunctsInSsa, 312 ConjunctsInUnsatCore, 69 InterpolantComputations, 24 PerfectInterpolantSequences, 7575/10465 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...