./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_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/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_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/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-11-10 11:27:06,438 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:27:06,439 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:27:06,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:27:06,445 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:27:06,446 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:27:06,447 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:27:06,448 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:27:06,449 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:27:06,449 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:27:06,450 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:27:06,450 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:27:06,451 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:27:06,451 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:27:06,452 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:27:06,452 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:27:06,453 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:27:06,454 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:27:06,455 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:27:06,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:27:06,456 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:27:06,457 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:27:06,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:27:06,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:27:06,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:27:06,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:27:06,459 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:27:06,459 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:27:06,460 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:27:06,461 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:27:06,461 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:27:06,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:27:06,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:27:06,461 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:27:06,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:27:06,463 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:27:06,463 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-10 11:27:06,471 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:27:06,471 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:27:06,472 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:27:06,472 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:27:06,472 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:27:06,472 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:27:06,472 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:27:06,473 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:27:06,473 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:27:06,473 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:27:06,473 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:27:06,473 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:27:06,473 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:27:06,474 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:27:06,474 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:27:06,474 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:27:06,474 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:27:06,474 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:27:06,474 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:27:06,474 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 11:27:06,475 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 11:27:06,475 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 11:27:06,475 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:27:06,475 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:27:06,475 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:27:06,475 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:27:06,475 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:27:06,475 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:27:06,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:27:06,476 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:27:06,476 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:27:06,476 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:27:06,476 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:27:06,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:27:06,476 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_0c001d99-cc20-4760-9a95-7d54e6f435fa/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-11-10 11:27:06,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:27:06,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:27:06,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:27:06,510 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:27:06,511 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:27:06,511 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-11-10 11:27:06,552 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/data/aa2ed3050/5efa69fd645941dca92a586a1be73544/FLAG9a66e845f [2018-11-10 11:27:06,950 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:27:06,950 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-11-10 11:27:06,955 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/data/aa2ed3050/5efa69fd645941dca92a586a1be73544/FLAG9a66e845f [2018-11-10 11:27:06,964 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/data/aa2ed3050/5efa69fd645941dca92a586a1be73544 [2018-11-10 11:27:06,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:27:06,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:27:06,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:27:06,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:27:06,970 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:27:06,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:27:06" (1/1) ... [2018-11-10 11:27:06,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61258a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:27:06, skipping insertion in model container [2018-11-10 11:27:06,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:27:06" (1/1) ... [2018-11-10 11:27:06,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:27:06,991 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:27:07,095 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:27:07,106 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:27:07,119 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:27:07,134 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:27:07,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:27:07 WrapperNode [2018-11-10 11:27:07,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:27:07,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:27:07,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:27:07,135 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:27:07,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:27:07" (1/1) ... [2018-11-10 11:27:07,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:27:07" (1/1) ... [2018-11-10 11:27:07,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:27:07,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:27:07,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:27:07,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:27:07,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:27:07" (1/1) ... [2018-11-10 11:27:07,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:27:07" (1/1) ... [2018-11-10 11:27:07,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:27:07" (1/1) ... [2018-11-10 11:27:07,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:27:07" (1/1) ... [2018-11-10 11:27:07,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:27:07" (1/1) ... [2018-11-10 11:27:07,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:27:07" (1/1) ... [2018-11-10 11:27:07,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:27:07" (1/1) ... [2018-11-10 11:27:07,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:27:07,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:27:07,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:27:07,236 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:27:07,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:27:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:27:07,272 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-11-10 11:27:07,272 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-11-10 11:27:07,273 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:27:07,273 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:27:07,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:27:07,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:27:07,273 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-11-10 11:27:07,273 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-11-10 11:27:07,273 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-11-10 11:27:07,273 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-11-10 11:27:07,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:27:07,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:27:07,273 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-10 11:27:07,273 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-10 11:27:07,781 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:27:07,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:27:07 BoogieIcfgContainer [2018-11-10 11:27:07,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:27:07,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:27:07,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:27:07,785 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:27:07,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:27:06" (1/3) ... [2018-11-10 11:27:07,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3ecd0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:27:07, skipping insertion in model container [2018-11-10 11:27:07,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:27:07" (2/3) ... [2018-11-10 11:27:07,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3ecd0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:27:07, skipping insertion in model container [2018-11-10 11:27:07,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:27:07" (3/3) ... [2018-11-10 11:27:07,789 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_true-valid-memsafety.c [2018-11-10 11:27:07,795 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:27:07,800 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-10 11:27:07,809 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-10 11:27:07,826 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:27:07,826 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 11:27:07,826 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:27:07,826 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:27:07,826 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:27:07,826 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:27:07,826 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:27:07,826 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:27:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-11-10 11:27:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 11:27:07,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:07,844 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:27:07,846 INFO L424 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:07,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash -122610617, now seen corresponding path program 1 times [2018-11-10 11:27:07,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:07,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:07,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:07,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:07,882 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:08,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:27:08,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:27:08,033 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:08,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:27:08,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:27:08,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:27:08,045 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2018-11-10 11:27:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:08,179 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-11-10 11:27:08,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:27:08,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-10 11:27:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:08,187 INFO L225 Difference]: With dead ends: 82 [2018-11-10 11:27:08,187 INFO L226 Difference]: Without dead ends: 77 [2018-11-10 11:27:08,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:27:08,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-10 11:27:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-11-10 11:27:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 11:27:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-11-10 11:27:08,211 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 13 [2018-11-10 11:27:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:08,211 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-11-10 11:27:08,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:27:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-10 11:27:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 11:27:08,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:08,212 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:27:08,213 INFO L424 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:08,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:08,213 INFO L82 PathProgramCache]: Analyzing trace with hash 494038318, now seen corresponding path program 1 times [2018-11-10 11:27:08,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:08,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:08,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:08,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:08,214 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:08,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:27:08,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:27:08,340 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:08,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:27:08,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:27:08,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:27:08,342 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 5 states. [2018-11-10 11:27:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:08,603 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-11-10 11:27:08,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:27:08,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-10 11:27:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:08,604 INFO L225 Difference]: With dead ends: 82 [2018-11-10 11:27:08,605 INFO L226 Difference]: Without dead ends: 82 [2018-11-10 11:27:08,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:27:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-10 11:27:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-11-10 11:27:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 11:27:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-11-10 11:27:08,612 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 14 [2018-11-10 11:27:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:08,612 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-11-10 11:27:08,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:27:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-10 11:27:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 11:27:08,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:08,613 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:27:08,614 INFO L424 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:08,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:08,614 INFO L82 PathProgramCache]: Analyzing trace with hash -786803888, now seen corresponding path program 1 times [2018-11-10 11:27:08,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:08,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:08,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:08,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:08,615 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:08,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:08,816 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:08,818 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-10 11:27:08,819 INFO L202 CegarAbsIntRunner]: [0], [1], [106], [110], [115], [117], [118], [119], [121], [127], [129], [131], [133], [134], [135], [137] [2018-11-10 11:27:08,853 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:27:08,853 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:27:09,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:27:09,582 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-11-10 11:27:09,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:09,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:27:09,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:09,588 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:27:09,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:09,593 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:27:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:09,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:09,669 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-11-10 11:27:09,697 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,718 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-11-10 11:27:09,784 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,785 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,786 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-11-10 11:27:09,820 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,822 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,826 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-11-10 11:27:09,870 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,871 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,872 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,873 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,874 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,875 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,879 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-11-10 11:27:09,880 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:09,897 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:09,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:09,946 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,947 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:09,959 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-11-10 11:27:10,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,020 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,021 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,022 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-11-10 11:27:10,058 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,064 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-11-10 11:27:10,065 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:10,082 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:10,110 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,116 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,126 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-11-10 11:27:10,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,204 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-11-10 11:27:10,205 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:10,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,255 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-11-10 11:27:10,255 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:10,289 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:27:10,312 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:10,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:10,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:10,356 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-11-10 11:27:10,359 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:10,359 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-11-10 11:27:10,361 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-11-10 11:27:10,364 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-11-10 11:27:10,378 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-11-10 11:27:10,379 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:10,392 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:10,398 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:10,404 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:10,408 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:10,423 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-11-10 11:27:10,423 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:84, output treesize:36 [2018-11-10 11:27:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:10,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:10,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:27:10,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2018-11-10 11:27:10,675 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:27:10,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 11:27:10,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 11:27:10,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-10 11:27:10,676 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 11 states. [2018-11-10 11:27:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:10,986 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-11-10 11:27:10,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:27:10,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-11-10 11:27:10,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:10,988 INFO L225 Difference]: With dead ends: 87 [2018-11-10 11:27:10,988 INFO L226 Difference]: Without dead ends: 87 [2018-11-10 11:27:10,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-11-10 11:27:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-10 11:27:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2018-11-10 11:27:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 11:27:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-10 11:27:10,992 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 19 [2018-11-10 11:27:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:10,992 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-10 11:27:10,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 11:27:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-10 11:27:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 11:27:10,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:10,993 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:27:10,994 INFO L424 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:10,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:10,994 INFO L82 PathProgramCache]: Analyzing trace with hash 41349742, now seen corresponding path program 2 times [2018-11-10 11:27:10,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:10,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:10,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:10,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:10,995 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:11,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:11,153 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:11,153 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:27:11,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:27:11,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:11,154 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:27:11,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:27:11,172 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:27:11,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 11:27:11,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:27:11,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:11,293 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-11-10 11:27:11,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,297 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,298 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-11-10 11:27:11,302 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,304 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-11-10 11:27:11,307 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,307 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,309 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-11-10 11:27:11,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,335 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-11-10 11:27:11,336 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,350 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,364 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,383 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-11-10 11:27:11,393 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,397 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-11-10 11:27:11,433 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,434 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-11-10 11:27:11,457 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,472 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,476 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-11-10 11:27:11,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,503 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,504 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,504 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,506 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-11-10 11:27:11,506 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,517 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,525 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,544 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,549 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-11-10 11:27:11,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,593 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,595 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,595 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,603 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-11-10 11:27:11,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,676 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,677 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,677 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,687 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-11-10 11:27:11,688 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,715 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,732 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,734 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,734 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,735 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,736 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-11-10 11:27:11,736 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,759 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,794 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,795 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-11-10 11:27:11,827 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,827 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,829 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,830 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,830 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,831 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:11,831 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-11-10 11:27:11,832 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,841 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,856 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,872 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,879 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:11,891 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-11-10 11:27:11,891 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:84, output treesize:36 [2018-11-10 11:27:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:27:12,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:27:12,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:27:12,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2018-11-10 11:27:12,236 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:27:12,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 11:27:12,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 11:27:12,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-11-10 11:27:12,237 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 15 states. [2018-11-10 11:27:13,419 WARN L179 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2018-11-10 11:27:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:13,563 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-11-10 11:27:13,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 11:27:13,563 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-11-10 11:27:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:13,564 INFO L225 Difference]: With dead ends: 91 [2018-11-10 11:27:13,564 INFO L226 Difference]: Without dead ends: 91 [2018-11-10 11:27:13,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=218, Invalid=594, Unknown=0, NotChecked=0, Total=812 [2018-11-10 11:27:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-10 11:27:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2018-11-10 11:27:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 11:27:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-10 11:27:13,568 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 24 [2018-11-10 11:27:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:13,568 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-10 11:27:13,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 11:27:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-10 11:27:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 11:27:13,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:13,569 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-11-10 11:27:13,569 INFO L424 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:13,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:13,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1614813209, now seen corresponding path program 1 times [2018-11-10 11:27:13,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:13,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:13,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:27:13,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:13,570 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 11:27:13,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:13,637 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:13,637 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-10 11:27:13,638 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-11-10 11:27:13,640 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:27:13,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:27:14,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:27:14,004 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-11-10 11:27:14,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:14,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:27:14,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:14,007 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:27:14,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:14,019 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:27:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:14,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:14,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:14,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:27:14,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2018-11-10 11:27:14,144 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:27:14,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 11:27:14,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 11:27:14,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-10 11:27:14,145 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 13 states. [2018-11-10 11:27:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:14,528 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-11-10 11:27:14,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 11:27:14,529 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-10 11:27:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:14,529 INFO L225 Difference]: With dead ends: 95 [2018-11-10 11:27:14,529 INFO L226 Difference]: Without dead ends: 95 [2018-11-10 11:27:14,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-11-10 11:27:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-10 11:27:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2018-11-10 11:27:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-10 11:27:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-10 11:27:14,533 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 34 [2018-11-10 11:27:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:14,533 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-10 11:27:14,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 11:27:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-10 11:27:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 11:27:14,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:14,534 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-11-10 11:27:14,534 INFO L424 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:14,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:14,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1779855763, now seen corresponding path program 1 times [2018-11-10 11:27:14,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:14,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:14,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:14,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:14,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:14,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:14,588 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:14,588 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-10 11:27:14,588 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-11-10 11:27:14,590 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:27:14,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:27:14,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:27:14,918 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-11-10 11:27:14,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:14,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:27:14,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:14,923 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:27:14,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:14,929 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:27:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:14,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:14,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:15,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:27:15,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-10 11:27:15,046 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:27:15,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 11:27:15,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:27:15,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:15,047 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 8 states. [2018-11-10 11:27:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:15,058 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-10 11:27:15,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:27:15,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-10 11:27:15,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:15,060 INFO L225 Difference]: With dead ends: 95 [2018-11-10 11:27:15,060 INFO L226 Difference]: Without dead ends: 95 [2018-11-10 11:27:15,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-10 11:27:15,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-11-10 11:27:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 11:27:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-10 11:27:15,065 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 40 [2018-11-10 11:27:15,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:15,065 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-10 11:27:15,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 11:27:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-10 11:27:15,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 11:27:15,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:15,066 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-11-10 11:27:15,066 INFO L424 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:15,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:15,067 INFO L82 PathProgramCache]: Analyzing trace with hash -392024561, now seen corresponding path program 2 times [2018-11-10 11:27:15,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:15,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:15,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:15,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:15,070 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:15,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:15,154 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:15,154 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:27:15,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:27:15,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:15,155 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:27:15,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:27:15,162 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:27:15,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 11:27:15,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:27:15,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:15,185 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-11-10 11:27:15,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,199 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-11-10 11:27:15,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,235 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-11-10 11:27:15,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,256 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,256 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,258 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-11-10 11:27:15,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,284 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-11-10 11:27:15,284 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,294 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,335 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-11-10 11:27:15,378 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,380 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,381 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,381 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-11-10 11:27:15,404 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,404 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,405 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,407 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,408 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,408 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-11-10 11:27:15,409 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,421 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,445 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,448 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,449 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,452 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,458 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-11-10 11:27:15,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,515 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,516 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,516 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,517 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,518 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-11-10 11:27:15,518 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,555 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,555 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,556 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,557 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,558 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,560 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-11-10 11:27:15,560 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,582 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,602 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,620 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,643 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-11-10 11:27:15,645 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:15,646 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-11-10 11:27:15,648 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-11-10 11:27:15,650 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-11-10 11:27:15,654 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-11-10 11:27:15,654 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,666 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,673 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,678 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,683 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:15,697 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-11-10 11:27:15,697 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:84, output treesize:36 [2018-11-10 11:27:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 11:27:15,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:15,914 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-10 11:27:15,955 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 11:27:16,000 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-10 11:27:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 11:27:16,097 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:27:16,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 18 [2018-11-10 11:27:16,097 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:16,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:27:16,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:27:16,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-11-10 11:27:16,098 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 7 states. [2018-11-10 11:27:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:16,564 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-11-10 11:27:16,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:27:16,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-10 11:27:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:16,565 INFO L225 Difference]: With dead ends: 96 [2018-11-10 11:27:16,565 INFO L226 Difference]: Without dead ends: 96 [2018-11-10 11:27:16,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-11-10 11:27:16,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-10 11:27:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-11-10 11:27:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 11:27:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-11-10 11:27:16,570 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 45 [2018-11-10 11:27:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:16,571 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-11-10 11:27:16,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:27:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-10 11:27:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 11:27:16,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:16,571 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-11-10 11:27:16,572 INFO L424 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:16,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:16,572 INFO L82 PathProgramCache]: Analyzing trace with hash 732140571, now seen corresponding path program 1 times [2018-11-10 11:27:16,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:16,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:16,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:27:16,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:16,573 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:16,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:16,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:16,611 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-10 11:27:16,611 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-11-10 11:27:16,612 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:27:16,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:27:16,920 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:27:16,920 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-11-10 11:27:16,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:16,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:27:16,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:16,931 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:27:16,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:16,948 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:27:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:16,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:16,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:17,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:27:17,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-10 11:27:17,056 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:27:17,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:27:17,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:27:17,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:17,057 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 9 states. [2018-11-10 11:27:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:17,072 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-11-10 11:27:17,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:27:17,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-11-10 11:27:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:17,074 INFO L225 Difference]: With dead ends: 99 [2018-11-10 11:27:17,074 INFO L226 Difference]: Without dead ends: 99 [2018-11-10 11:27:17,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-10 11:27:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-11-10 11:27:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-10 11:27:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-11-10 11:27:17,077 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 46 [2018-11-10 11:27:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:17,078 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-11-10 11:27:17,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:27:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-10 11:27:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 11:27:17,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:17,079 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-11-10 11:27:17,079 INFO L424 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:17,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:17,083 INFO L82 PathProgramCache]: Analyzing trace with hash 215642685, now seen corresponding path program 2 times [2018-11-10 11:27:17,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:17,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:17,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:17,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:17,084 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:17,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:17,142 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:17,143 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:27:17,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:27:17,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:17,143 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:27:17,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:27:17,161 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:27:17,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 11:27:17,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:27:17,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:17,183 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-11-10 11:27:17,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,199 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-11-10 11:27:17,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,212 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-11-10 11:27:17,261 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,262 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,264 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,265 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-11-10 11:27:17,269 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-11-10 11:27:17,275 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-11-10 11:27:17,276 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:17,286 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:17,296 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:17,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,323 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,334 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-11-10 11:27:17,346 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-11-10 11:27:17,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,355 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,360 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-11-10 11:27:17,361 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-10 11:27:17,415 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-11-10 11:27:17,415 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:17,451 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:27:17,512 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,512 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,515 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,516 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-11-10 11:27:17,534 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-11-10 11:27:17,535 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:17,552 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:17,612 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 11:27:17,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 11:27:17,719 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-11-10 11:27:17,728 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:17,732 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-11-10 11:27:17,736 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-11-10 11:27:17,742 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-11-10 11:27:17,743 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:17,751 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:17,757 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:17,766 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:17,833 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 11:27:17,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 11:27:17,936 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-11-10 11:27:17,937 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:39, output treesize:237 [2018-11-10 11:27:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-10 11:27:18,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-10 11:27:18,138 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:27:18,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 13 [2018-11-10 11:27:18,138 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:18,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:27:18,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:27:18,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:18,139 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 4 states. [2018-11-10 11:27:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:18,304 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-10 11:27:18,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:27:18,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-10 11:27:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:18,305 INFO L225 Difference]: With dead ends: 102 [2018-11-10 11:27:18,305 INFO L226 Difference]: Without dead ends: 102 [2018-11-10 11:27:18,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:27:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-10 11:27:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2018-11-10 11:27:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-10 11:27:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-10 11:27:18,308 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 51 [2018-11-10 11:27:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:18,309 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-10 11:27:18,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:27:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-10 11:27:18,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 11:27:18,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:18,310 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-11-10 11:27:18,310 INFO L424 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:18,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1905011281, now seen corresponding path program 1 times [2018-11-10 11:27:18,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:18,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:18,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:27:18,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:18,314 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:18,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:18,387 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:18,387 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-10 11:27:18,387 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-11-10 11:27:18,389 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:27:18,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:27:18,704 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:27:18,704 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-11-10 11:27:18,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:18,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:27:18,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:18,711 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:27:18,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:18,717 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:27:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:18,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:18,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:18,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:27:18,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-11-10 11:27:18,829 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:27:18,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 11:27:18,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:27:18,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:18,829 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 10 states. [2018-11-10 11:27:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:18,846 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-10 11:27:18,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:27:18,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-11-10 11:27:18,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:18,847 INFO L225 Difference]: With dead ends: 103 [2018-11-10 11:27:18,847 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 11:27:18,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:18,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 11:27:18,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-11-10 11:27:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 11:27:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-11-10 11:27:18,857 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 52 [2018-11-10 11:27:18,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:18,857 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-10 11:27:18,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 11:27:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-11-10 11:27:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 11:27:18,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:18,859 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-11-10 11:27:18,859 INFO L424 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:18,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:18,859 INFO L82 PathProgramCache]: Analyzing trace with hash -585100719, now seen corresponding path program 2 times [2018-11-10 11:27:18,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:18,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:18,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:18,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:18,860 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:27:18,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:18,928 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:18,928 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:27:18,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:27:18,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:18,929 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:27:18,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:27:18,936 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:27:18,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 11:27:18,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:27:18,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:18,958 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-11-10 11:27:18,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:18,991 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-11-10 11:27:18,994 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:18,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,004 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-11-10 11:27:19,043 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,044 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,046 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,050 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,055 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-11-10 11:27:19,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,109 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-11-10 11:27:19,110 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,137 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,137 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,143 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,145 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,146 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,147 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,147 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-11-10 11:27:19,147 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,168 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,195 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-11-10 11:27:19,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,217 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-11-10 11:27:19,217 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,225 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,267 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-11-10 11:27:19,279 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,284 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-11-10 11:27:19,305 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,306 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,307 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,307 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,312 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-11-10 11:27:19,312 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,320 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,328 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,342 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,359 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-11-10 11:27:19,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,365 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-11-10 11:27:19,368 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-11-10 11:27:19,372 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-11-10 11:27:19,381 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-11-10 11:27:19,382 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,390 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,395 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,407 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,409 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,424 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-11-10 11:27:19,426 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-11-10 11:27:19,430 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-11-10 11:27:19,431 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,442 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,457 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,459 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:19,459 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-11-10 11:27:19,465 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-11-10 11:27:19,465 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,479 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:19,493 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:27:19,514 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:27:19,533 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:27:19,558 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-11-10 11:27:19,558 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 7 variables, input treesize:59, output treesize:60 [2018-11-10 11:27:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-10 11:27:19,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-10 11:27:19,822 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:27:19,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 18 [2018-11-10 11:27:19,822 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:19,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:27:19,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:27:19,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-11-10 11:27:19,823 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 6 states. [2018-11-10 11:27:20,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:20,006 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-10 11:27:20,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:27:20,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-10 11:27:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:20,007 INFO L225 Difference]: With dead ends: 103 [2018-11-10 11:27:20,007 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 11:27:20,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-11-10 11:27:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 11:27:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-11-10 11:27:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 11:27:20,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-10 11:27:20,010 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 57 [2018-11-10 11:27:20,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:20,011 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-10 11:27:20,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:27:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-10 11:27:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 11:27:20,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:20,012 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-11-10 11:27:20,012 INFO L424 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:20,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1635173283, now seen corresponding path program 1 times [2018-11-10 11:27:20,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:20,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:20,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:27:20,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:20,013 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-10 11:27:20,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:27:20,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 11:27:20,069 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:20,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:27:20,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:27:20,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:27:20,070 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 9 states. [2018-11-10 11:27:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:20,384 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-10 11:27:20,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:27:20,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-10 11:27:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:20,385 INFO L225 Difference]: With dead ends: 107 [2018-11-10 11:27:20,385 INFO L226 Difference]: Without dead ends: 107 [2018-11-10 11:27:20,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-10 11:27:20,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2018-11-10 11:27:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 11:27:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-11-10 11:27:20,388 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 67 [2018-11-10 11:27:20,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:20,388 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-10 11:27:20,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:27:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-11-10 11:27:20,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 11:27:20,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:20,389 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-11-10 11:27:20,390 INFO L424 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:20,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:20,390 INFO L82 PathProgramCache]: Analyzing trace with hash -849235733, now seen corresponding path program 1 times [2018-11-10 11:27:20,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:20,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:20,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:20,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:20,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:27:20,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:20,460 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:20,460 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-11-10 11:27:20,460 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-11-10 11:27:20,462 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:27:20,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:27:21,335 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:27:21,335 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-11-10 11:27:21,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:21,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:27:21,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:21,339 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:27:21,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:21,347 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:27:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:21,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:27:21,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:27:21,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:27:21,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-11-10 11:27:21,473 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:27:21,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 11:27:21,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 11:27:21,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:21,474 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 11 states. [2018-11-10 11:27:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:21,490 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-10 11:27:21,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 11:27:21,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-10 11:27:21,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:21,491 INFO L225 Difference]: With dead ends: 108 [2018-11-10 11:27:21,491 INFO L226 Difference]: Without dead ends: 108 [2018-11-10 11:27:21,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-10 11:27:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2018-11-10 11:27:21,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 11:27:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-10 11:27:21,493 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 68 [2018-11-10 11:27:21,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:21,493 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-10 11:27:21,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 11:27:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-10 11:27:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 11:27:21,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:21,494 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-11-10 11:27:21,494 INFO L424 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:21,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:21,494 INFO L82 PathProgramCache]: Analyzing trace with hash 529820045, now seen corresponding path program 2 times [2018-11-10 11:27:21,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:21,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:21,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:21,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:21,495 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:27:21,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:21,605 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:21,605 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:27:21,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:27:21,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:21,606 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/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-11-10 11:27:21,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:27:21,617 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:27:21,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 11:27:21,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:27:21,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:21,652 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-11-10 11:27:21,668 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,673 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-11-10 11:27:21,676 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-11-10 11:27:21,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,695 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,695 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-11-10 11:27:21,723 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,741 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,742 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,747 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,756 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-11-10 11:27:21,756 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:21,765 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:21,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:21,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,795 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,800 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-11-10 11:27:21,833 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,834 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,856 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-11-10 11:27:21,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,921 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-11-10 11:27:21,921 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:21,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,946 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,948 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,948 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,955 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-11-10 11:27:21,955 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:21,973 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:21,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:21,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,001 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-11-10 11:27:22,040 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,042 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,042 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,043 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,044 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,047 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,047 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-11-10 11:27:22,048 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:22,055 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:22,070 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:22,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:22,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:22,101 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-11-10 11:27:22,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,109 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-11-10 11:27:22,111 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-11-10 11:27:22,113 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-11-10 11:27:22,116 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-11-10 11:27:22,116 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:22,123 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:22,127 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:22,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,143 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-11-10 11:27:22,145 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-11-10 11:27:22,148 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-11-10 11:27:22,148 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:22,158 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:22,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:22,172 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-11-10 11:27:22,177 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-11-10 11:27:22,177 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:22,188 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:22,200 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:27:22,217 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:27:22,233 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:27:22,263 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-11-10 11:27:22,264 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 7 variables, input treesize:59, output treesize:60 [2018-11-10 11:27:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-10 11:27:22,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:22,482 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-10 11:27:22,523 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 11:27:22,552 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 11:27:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-10 11:27:22,631 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:27:22,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [11] total 21 [2018-11-10 11:27:22,631 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:22,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:27:22,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:27:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-11-10 11:27:22,632 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 7 states. [2018-11-10 11:27:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:22,942 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-11-10 11:27:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:27:22,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-11-10 11:27:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:22,943 INFO L225 Difference]: With dead ends: 109 [2018-11-10 11:27:22,943 INFO L226 Difference]: Without dead ends: 109 [2018-11-10 11:27:22,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2018-11-10 11:27:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-10 11:27:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-11-10 11:27:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-10 11:27:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-11-10 11:27:22,946 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 73 [2018-11-10 11:27:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:22,946 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-11-10 11:27:22,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:27:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-11-10 11:27:22,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 11:27:22,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:22,947 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-11-10 11:27:22,948 INFO L424 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:22,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:22,948 INFO L82 PathProgramCache]: Analyzing trace with hash -755447741, now seen corresponding path program 1 times [2018-11-10 11:27:22,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:22,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:27:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:22,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:27:23,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:23,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:23,024 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 75 with the following transitions: [2018-11-10 11:27:23,024 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-11-10 11:27:23,026 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:27:23,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:27:23,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:27:23,873 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-11-10 11:27:23,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:23,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:27:23,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:23,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/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-11-10 11:27:23,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:23,894 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:27:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:23,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:27:23,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:27:23,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:27:23,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-11-10 11:27:23,998 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:27:23,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 11:27:23,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 11:27:23,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:23,999 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 12 states. [2018-11-10 11:27:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:24,020 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-11-10 11:27:24,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 11:27:24,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2018-11-10 11:27:24,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:24,022 INFO L225 Difference]: With dead ends: 112 [2018-11-10 11:27:24,022 INFO L226 Difference]: Without dead ends: 112 [2018-11-10 11:27:24,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 139 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-10 11:27:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-11-10 11:27:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-10 11:27:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-11-10 11:27:24,025 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 74 [2018-11-10 11:27:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:24,025 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-11-10 11:27:24,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 11:27:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-10 11:27:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 11:27:24,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:24,026 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-11-10 11:27:24,026 INFO L424 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:24,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:24,026 INFO L82 PathProgramCache]: Analyzing trace with hash 737345381, now seen corresponding path program 2 times [2018-11-10 11:27:24,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:24,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:24,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:24,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:24,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:27:24,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:24,155 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:24,155 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:27:24,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:27:24,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:24,155 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/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-11-10 11:27:24,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:27:24,163 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:27:24,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 11:27:24,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:27:24,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:24,186 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-11-10 11:27:24,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:24,204 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-11-10 11:27:24,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:24,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:24,221 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-11-10 11:27:24,224 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:24,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:24,233 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-11-10 11:27:24,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:24,242 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:24,248 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-11-10 11:27:24,253 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-11-10 11:27:24,253 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:24,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:24,279 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:24,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:24,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:24,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:24,287 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-11-10 11:27:24,287 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-10 11:27:24,316 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:27:24,352 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-11-10 11:27:24,357 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-11-10 11:27:24,358 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:24,365 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:24,397 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 11:27:24,434 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-11-10 11:27:24,439 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-11-10 11:27:24,445 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-11-10 11:27:24,445 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:24,450 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:24,456 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:24,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 11:27:24,530 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-11-10 11:27:24,533 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-11-10 11:27:24,540 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-11-10 11:27:24,546 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-11-10 11:27:24,546 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:24,551 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:24,555 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:24,559 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:24,595 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 11:27:24,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 11:27:24,661 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-11-10 11:27:24,661 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:21, output treesize:165 [2018-11-10 11:27:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 11:27:24,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-10 11:27:24,792 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:27:24,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [12] total 16 [2018-11-10 11:27:24,792 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:24,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:27:24,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:27:24,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-11-10 11:27:24,793 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 4 states. [2018-11-10 11:27:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:24,918 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-11-10 11:27:24,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:27:24,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-10 11:27:24,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:24,919 INFO L225 Difference]: With dead ends: 115 [2018-11-10 11:27:24,919 INFO L226 Difference]: Without dead ends: 115 [2018-11-10 11:27:24,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-11-10 11:27:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-10 11:27:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2018-11-10 11:27:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-10 11:27:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-11-10 11:27:24,922 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 79 [2018-11-10 11:27:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:24,922 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-11-10 11:27:24,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:27:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-10 11:27:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 11:27:24,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:24,923 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-11-10 11:27:24,924 INFO L424 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:24,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:24,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1382870381, now seen corresponding path program 1 times [2018-11-10 11:27:24,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:24,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:24,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:27:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:24,925 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:27:24,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:24,987 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:24,987 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-11-10 11:27:24,987 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-11-10 11:27:24,989 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:27:24,989 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:27:25,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:27:25,836 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-11-10 11:27:25,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:25,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:27:25,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:25,843 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:27:25,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:25,859 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:27:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:25,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:27:25,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:27:25,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:27:25,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-11-10 11:27:25,989 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:27:25,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 11:27:25,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 11:27:25,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:25,989 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 13 states. [2018-11-10 11:27:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:26,010 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-10 11:27:26,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 11:27:26,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-11-10 11:27:26,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:26,011 INFO L225 Difference]: With dead ends: 113 [2018-11-10 11:27:26,011 INFO L226 Difference]: Without dead ends: 113 [2018-11-10 11:27:26,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 150 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-10 11:27:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-11-10 11:27:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-10 11:27:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-10 11:27:26,014 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 80 [2018-11-10 11:27:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:26,014 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-10 11:27:26,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 11:27:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-10 11:27:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 11:27:26,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:26,015 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-11-10 11:27:26,015 INFO L424 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:26,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:26,016 INFO L82 PathProgramCache]: Analyzing trace with hash 87409423, now seen corresponding path program 2 times [2018-11-10 11:27:26,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:26,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:26,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-10 11:27:26,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:26,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:26,047 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:27:26,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:27:26,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:26,048 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/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-11-10 11:27:26,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:27:26,064 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:27:26,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 11:27:26,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:27:26,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:26,091 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-11-10 11:27:26,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,113 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-11-10 11:27:26,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,117 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,122 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-11-10 11:27:26,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,127 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,132 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-11-10 11:27:26,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,147 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,150 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-11-10 11:27:26,150 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,189 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-11-10 11:27:26,190 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,215 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:27:26,245 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-11-10 11:27:26,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,252 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-11-10 11:27:26,252 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,263 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:27:26,318 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-11-10 11:27:26,322 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-11-10 11:27:26,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,330 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-11-10 11:27:26,330 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,338 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,344 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,373 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 11:27:26,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 11:27:26,433 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-11-10 11:27:26,436 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,447 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-11-10 11:27:26,450 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-11-10 11:27:26,453 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-11-10 11:27:26,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,472 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-11-10 11:27:26,472 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,478 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,483 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,496 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,498 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,502 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-11-10 11:27:26,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,508 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,513 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-11-10 11:27:26,549 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,550 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,550 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,552 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-11-10 11:27:26,553 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,573 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,575 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,576 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,581 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,581 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,582 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-11-10 11:27:26,582 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,602 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:27:26,624 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-11-10 11:27:26,632 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,633 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,634 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:26,638 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-11-10 11:27:26,638 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,643 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,654 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,665 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,669 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:26,701 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-11-10 11:27:26,701 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:42, output treesize:44 [2018-11-10 11:27:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 11:27:26,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 11:27:26,957 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:27:26,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 12 [2018-11-10 11:27:26,957 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:26,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:27:26,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:27:26,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-10 11:27:26,958 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 6 states. [2018-11-10 11:27:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:27,105 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-11-10 11:27:27,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:27:27,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-10 11:27:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:27,106 INFO L225 Difference]: With dead ends: 116 [2018-11-10 11:27:27,106 INFO L226 Difference]: Without dead ends: 116 [2018-11-10 11:27:27,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:27:27,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-10 11:27:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-11-10 11:27:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-10 11:27:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2018-11-10 11:27:27,107 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 85 [2018-11-10 11:27:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:27,108 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2018-11-10 11:27:27,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:27:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2018-11-10 11:27:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 11:27:27,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:27,108 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-11-10 11:27:27,108 INFO L424 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:27,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:27,108 INFO L82 PathProgramCache]: Analyzing trace with hash -113863873, now seen corresponding path program 1 times [2018-11-10 11:27:27,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:27,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:27,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:27:27,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:27,109 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:27,154 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 11:27:27,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:27:27,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 11:27:27,154 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:27,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 11:27:27,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:27:27,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:27:27,155 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand 8 states. [2018-11-10 11:27:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:27,484 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-11-10 11:27:27,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:27:27,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-11-10 11:27:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:27,485 INFO L225 Difference]: With dead ends: 120 [2018-11-10 11:27:27,485 INFO L226 Difference]: Without dead ends: 120 [2018-11-10 11:27:27,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:27:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-10 11:27:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2018-11-10 11:27:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-10 11:27:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-10 11:27:27,488 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 95 [2018-11-10 11:27:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:27,488 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-10 11:27:27,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 11:27:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-10 11:27:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 11:27:27,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:27,489 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-11-10 11:27:27,490 INFO L424 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:27,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:27,490 INFO L82 PathProgramCache]: Analyzing trace with hash 765187331, now seen corresponding path program 1 times [2018-11-10 11:27:27,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:27,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:27,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:27,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:27,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 11:27:27,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:27,535 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:27,535 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 97 with the following transitions: [2018-11-10 11:27:27,537 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-11-10 11:27:27,539 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:27:27,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:27:29,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:27:29,020 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-11-10 11:27:29,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:29,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:27:29,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:29,027 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/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-11-10 11:27:29,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:29,033 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:27:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:29,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 11:27:29,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 11:27:29,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:27:29,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-10 11:27:29,143 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:27:29,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:27:29,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:27:29,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:27:29,144 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 5 states. [2018-11-10 11:27:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:29,153 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-10 11:27:29,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:27:29,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-11-10 11:27:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:29,153 INFO L225 Difference]: With dead ends: 125 [2018-11-10 11:27:29,153 INFO L226 Difference]: Without dead ends: 125 [2018-11-10 11:27:29,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:27:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-10 11:27:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2018-11-10 11:27:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-10 11:27:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2018-11-10 11:27:29,156 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 96 [2018-11-10 11:27:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:29,156 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2018-11-10 11:27:29,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:27:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2018-11-10 11:27:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 11:27:29,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:29,157 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-11-10 11:27:29,157 INFO L424 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:29,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:29,157 INFO L82 PathProgramCache]: Analyzing trace with hash -863102084, now seen corresponding path program 2 times [2018-11-10 11:27:29,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:29,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:29,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:29,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:29,164 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 11:27:29,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:29,206 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:29,206 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:27:29,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:27:29,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:29,207 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/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-11-10 11:27:29,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:27:29,221 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:27:29,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 11:27:29,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:27:29,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:29,255 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-11-10 11:27:29,272 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,283 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-11-10 11:27:29,287 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-11-10 11:27:29,291 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-11-10 11:27:29,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,297 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,307 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-11-10 11:27:29,308 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,364 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,384 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,387 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,393 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-11-10 11:27:29,396 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-11-10 11:27:29,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,404 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-11-10 11:27:29,404 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,417 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,431 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,439 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-11-10 11:27:29,441 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,442 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,445 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-11-10 11:27:29,445 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,472 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,475 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-11-10 11:27:29,475 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,499 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:27:29,522 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:27:29,548 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 11:27:29,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 11:27:29,594 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-11-10 11:27:29,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,600 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-11-10 11:27:29,602 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-11-10 11:27:29,605 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-11-10 11:27:29,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,612 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,612 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,615 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-11-10 11:27:29,615 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,619 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,624 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,634 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,639 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-11-10 11:27:29,642 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,644 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,648 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-11-10 11:27:29,677 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,681 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,682 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,682 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,683 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-11-10 11:27:29,683 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,704 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,704 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-11-10 11:27:29,704 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,714 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,729 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-11-10 11:27:29,735 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,736 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:27:29,739 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-11-10 11:27:29,739 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,744 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,752 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,762 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,766 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:29,792 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-11-10 11:27:29,792 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:42, output treesize:44 [2018-11-10 11:27:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-11-10 11:27:29,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:29,914 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-10 11:27:29,952 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 11:27:29,975 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-10 11:27:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-11-10 11:27:30,051 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:27:30,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [5] total 15 [2018-11-10 11:27:30,051 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:30,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:27:30,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:27:30,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-10 11:27:30,052 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand 7 states. [2018-11-10 11:27:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:30,351 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2018-11-10 11:27:30,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:27:30,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-11-10 11:27:30,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:30,351 INFO L225 Difference]: With dead ends: 124 [2018-11-10 11:27:30,351 INFO L226 Difference]: Without dead ends: 124 [2018-11-10 11:27:30,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-10 11:27:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-10 11:27:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2018-11-10 11:27:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-10 11:27:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-10 11:27:30,353 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 103 [2018-11-10 11:27:30,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:30,354 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-10 11:27:30,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:27:30,354 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-10 11:27:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 11:27:30,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:30,354 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-11-10 11:27:30,354 INFO L424 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:30,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:30,354 INFO L82 PathProgramCache]: Analyzing trace with hash -986360728, now seen corresponding path program 1 times [2018-11-10 11:27:30,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:30,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:30,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:27:30,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:30,355 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-11-10 11:27:30,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:27:30,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:27:30,382 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:30,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:27:30,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:27:30,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:27:30,383 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 4 states. [2018-11-10 11:27:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:30,496 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-11-10 11:27:30,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:27:30,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-11-10 11:27:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:30,499 INFO L225 Difference]: With dead ends: 125 [2018-11-10 11:27:30,499 INFO L226 Difference]: Without dead ends: 125 [2018-11-10 11:27:30,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:27:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-10 11:27:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 118. [2018-11-10 11:27:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-10 11:27:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2018-11-10 11:27:30,502 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 104 [2018-11-10 11:27:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:30,502 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2018-11-10 11:27:30,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:27:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2018-11-10 11:27:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 11:27:30,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:30,503 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-11-10 11:27:30,503 INFO L424 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:30,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:30,503 INFO L82 PathProgramCache]: Analyzing trace with hash -512411394, now seen corresponding path program 1 times [2018-11-10 11:27:30,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:30,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:30,504 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 11:27:30,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:30,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:30,530 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2018-11-10 11:27:30,530 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-11-10 11:27:30,532 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:27:30,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:27:31,985 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:27:31,985 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-11-10 11:27:31,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:31,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:27:31,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:31,991 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/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-11-10 11:27:32,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:32,008 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:27:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:32,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 11:27:32,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 11:27:32,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:27:32,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-10 11:27:32,120 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:27:32,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:27:32,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:27:32,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:27:32,120 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand 6 states. [2018-11-10 11:27:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:32,134 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-11-10 11:27:32,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:27:32,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-10 11:27:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:32,136 INFO L225 Difference]: With dead ends: 130 [2018-11-10 11:27:32,136 INFO L226 Difference]: Without dead ends: 130 [2018-11-10 11:27:32,136 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-11-10 11:27:32,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-10 11:27:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-11-10 11:27:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-10 11:27:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-10 11:27:32,138 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 105 [2018-11-10 11:27:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:32,139 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-10 11:27:32,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:27:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-10 11:27:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 11:27:32,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:32,140 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-11-10 11:27:32,140 INFO L424 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:32,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2120755877, now seen corresponding path program 2 times [2018-11-10 11:27:32,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:32,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:32,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:32,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:32,141 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-10 11:27:32,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:32,179 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:32,179 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:27:32,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:27:32,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:32,179 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/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-11-10 11:27:32,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:27:32,195 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:27:32,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 11:27:32,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:27:32,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:32,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 11:27:32,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:32,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:32,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 11:27:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-11-10 11:27:32,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-11-10 11:27:32,398 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:27:32,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 14 [2018-11-10 11:27:32,398 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:32,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:27:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:27:32,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:27:32,399 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 6 states. [2018-11-10 11:27:32,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:32,562 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-10 11:27:32,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:27:32,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-11-10 11:27:32,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:32,563 INFO L225 Difference]: With dead ends: 128 [2018-11-10 11:27:32,563 INFO L226 Difference]: Without dead ends: 128 [2018-11-10 11:27:32,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-10 11:27:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-10 11:27:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-10 11:27:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-10 11:27:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2018-11-10 11:27:32,566 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 112 [2018-11-10 11:27:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:32,566 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2018-11-10 11:27:32,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:27:32,566 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-10 11:27:32,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 11:27:32,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:32,567 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-11-10 11:27:32,567 INFO L424 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:32,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:32,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1279643879, now seen corresponding path program 1 times [2018-11-10 11:27:32,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:32,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:32,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:27:32,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:32,568 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-10 11:27:32,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:27:32,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:27:32,633 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:32,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:27:32,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:27:32,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:27:32,634 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand 7 states. [2018-11-10 11:27:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:33,016 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-11-10 11:27:33,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:27:33,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-11-10 11:27:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:33,018 INFO L225 Difference]: With dead ends: 127 [2018-11-10 11:27:33,018 INFO L226 Difference]: Without dead ends: 127 [2018-11-10 11:27:33,019 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-11-10 11:27:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-10 11:27:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-11-10 11:27:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-10 11:27:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-10 11:27:33,021 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 122 [2018-11-10 11:27:33,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:33,021 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-10 11:27:33,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:27:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-10 11:27:33,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 11:27:33,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:33,022 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-11-10 11:27:33,022 INFO L424 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:33,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:33,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1014254712, now seen corresponding path program 1 times [2018-11-10 11:27:33,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:33,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:33,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:33,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:33,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-11-10 11:27:33,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:33,097 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:33,098 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-11-10 11:27:33,098 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-11-10 11:27:33,103 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:27:33,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:27:35,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:27:35,442 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-11-10 11:27:35,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:35,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:27:35,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:35,443 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/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-11-10 11:27:35,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:35,466 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:27:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:35,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-11-10 11:27:35,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-11-10 11:27:35,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:27:35,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-10 11:27:35,575 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:27:35,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:27:35,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:27:35,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:27:35,575 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 7 states. [2018-11-10 11:27:35,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:35,588 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-10 11:27:35,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:27:35,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2018-11-10 11:27:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:35,589 INFO L225 Difference]: With dead ends: 137 [2018-11-10 11:27:35,589 INFO L226 Difference]: Without dead ends: 137 [2018-11-10 11:27:35,589 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-11-10 11:27:35,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-10 11:27:35,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2018-11-10 11:27:35,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 11:27:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2018-11-10 11:27:35,591 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 123 [2018-11-10 11:27:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:35,591 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2018-11-10 11:27:35,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:27:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-11-10 11:27:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 11:27:35,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:27:35,592 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-11-10 11:27:35,593 INFO L424 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers3Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbers4Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, getNumbersErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 11:27:35,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:27:35,593 INFO L82 PathProgramCache]: Analyzing trace with hash -787299745, now seen corresponding path program 2 times [2018-11-10 11:27:35,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:27:35,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:35,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:27:35,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:27:35,594 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:27:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:27:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-11-10 11:27:35,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:35,659 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:27:35,659 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:27:35,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:27:35,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:27:35,660 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/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-11-10 11:27:35,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:27:35,669 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:27:35,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 11:27:35,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:27:35,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:27:35,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 11:27:35,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 11:27:35,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:27:35,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-11-10 11:27:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2018-11-10 11:27:35,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:27:35,896 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 11:27:35,938 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-11-10 11:27:35,951 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-11-10 11:27:35,990 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-11-10 11:27:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2018-11-10 11:27:36,055 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:27:36,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2018-11-10 11:27:36,055 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:27:36,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:27:36,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:27:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-10 11:27:36,056 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand 7 states. [2018-11-10 11:27:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:27:36,356 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-10 11:27:36,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:27:36,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-11-10 11:27:36,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:27:36,356 INFO L225 Difference]: With dead ends: 133 [2018-11-10 11:27:36,356 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 11:27:36,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-11-10 11:27:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 11:27:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 11:27:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 11:27:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:27:36,357 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 130 [2018-11-10 11:27:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:27:36,357 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:27:36,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:27:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:27:36,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 11:27:36,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:27:36 BoogieIcfgContainer [2018-11-10 11:27:36,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:27:36,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:27:36,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:27:36,361 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:27:36,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:27:07" (3/4) ... [2018-11-10 11:27:36,364 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 11:27:36,370 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 11:27:36,370 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2018-11-10 11:27:36,370 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2018-11-10 11:27:36,370 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2018-11-10 11:27:36,370 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 11:27:36,370 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2018-11-10 11:27:36,377 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 157 nodes and edges [2018-11-10 11:27:36,377 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2018-11-10 11:27:36,377 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 50 nodes and edges [2018-11-10 11:27:36,378 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 11:27:36,416 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0c001d99-cc20-4760-9a95-7d54e6f435fa/bin-2019/utaipan/witness.graphml [2018-11-10 11:27:36,417 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:27:36,417 INFO L168 Benchmark]: Toolchain (without parser) took 29450.48 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 960.3 MB in the beginning and 1.3 GB in the end (delta: -357.4 MB). Peak memory consumption was 858.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:27:36,418 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:27:36,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.82 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:27:36,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.41 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 944.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:27:36,418 INFO L168 Benchmark]: Boogie Preprocessor took 70.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -186.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:27:36,418 INFO L168 Benchmark]: RCFGBuilder took 546.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 78.8 MB). Peak memory consumption was 78.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:27:36,418 INFO L168 Benchmark]: TraceAbstraction took 28577.98 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -266.2 MB). Peak memory consumption was 815.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:27:36,419 INFO L168 Benchmark]: Witness Printer took 55.65 ms. Allocated memory is still 2.2 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:27:36,420 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.82 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 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 30.41 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 944.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -186.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 546.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 78.8 MB). Peak memory consumption was 78.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28577.98 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -266.2 MB). Peak memory consumption was 815.4 MB. Max. memory is 11.5 GB. * Witness Printer took 55.65 ms. Allocated memory is still 2.2 GB. Free memory is still 1.3 GB. There was no memory consumed. 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: 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 - 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, 28.5s OverallTime, 27 OverallIterations, 11 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1558 SDtfs, 1493 SDslu, 5478 SDs, 0 SdLazy, 2454 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3233 GetRequests, 2851 SyntacticMatches, 40 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 4.5s 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, 10.0s AbstIntTime, 11 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 121 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.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...