./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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_34be3860-a3d2-43d3-839c-7b1d29d777d2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-635dfa2 [2018-12-08 20:30:38,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:30:38,265 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:30:38,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:30:38,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:30:38,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:30:38,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:30:38,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:30:38,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:30:38,274 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:30:38,275 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:30:38,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:30:38,276 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:30:38,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:30:38,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:30:38,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:30:38,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:30:38,279 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:30:38,280 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:30:38,280 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:30:38,281 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:30:38,282 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:30:38,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:30:38,283 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:30:38,283 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:30:38,284 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:30:38,284 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:30:38,285 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:30:38,285 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:30:38,286 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:30:38,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:30:38,286 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:30:38,287 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:30:38,287 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:30:38,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:30:38,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:30:38,288 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-08 20:30:38,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:30:38,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:30:38,296 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 20:30:38,296 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 20:30:38,296 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 20:30:38,296 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 20:30:38,296 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 20:30:38,297 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 20:30:38,297 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 20:30:38,297 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 20:30:38,297 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 20:30:38,297 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 20:30:38,297 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 20:30:38,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 20:30:38,297 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 20:30:38,298 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:30:38,298 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 20:30:38,298 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 20:30:38,298 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 20:30:38,298 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 20:30:38,298 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:30:38,298 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 20:30:38,298 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 20:30:38,298 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 20:30:38,298 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 20:30:38,298 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 20:30:38,299 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:30:38,299 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:30:38,299 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 20:30:38,299 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 20:30:38,299 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:30:38,299 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:30:38,299 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 20:30:38,299 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 20:30:38,299 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 20:30:38,299 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 20:30:38,299 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_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:38,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:30:38,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:30:38,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:30:38,326 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:30:38,326 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:30:38,326 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-12-08 20:30:38,361 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/bin-2019/utaipan/data/1142cad02/4e140f60e08b4481bb6c9995ea0ddce8/FLAGd58dbfdca [2018-12-08 20:30:38,689 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:30:38,689 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-12-08 20:30:38,693 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/bin-2019/utaipan/data/1142cad02/4e140f60e08b4481bb6c9995ea0ddce8/FLAGd58dbfdca [2018-12-08 20:30:39,098 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/bin-2019/utaipan/data/1142cad02/4e140f60e08b4481bb6c9995ea0ddce8 [2018-12-08 20:30:39,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:30:39,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:30:39,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:30:39,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:30:39,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:30:39,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:30:39" (1/1) ... [2018-12-08 20:30:39,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c57853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:30:39, skipping insertion in model container [2018-12-08 20:30:39,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:30:39" (1/1) ... [2018-12-08 20:30:39,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:30:39,123 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:30:39,217 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:30:39,226 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:30:39,238 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:30:39,252 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:30:39,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:30:39 WrapperNode [2018-12-08 20:30:39,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:30:39,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:30:39,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:30:39,253 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:30:39,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:30:39" (1/1) ... [2018-12-08 20:30:39,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:30:39" (1/1) ... [2018-12-08 20:30:39,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:30:39,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:30:39,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:30:39,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:30:39,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:30:39" (1/1) ... [2018-12-08 20:30:39,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:30:39" (1/1) ... [2018-12-08 20:30:39,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:30:39" (1/1) ... [2018-12-08 20:30:39,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:30:39" (1/1) ... [2018-12-08 20:30:39,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:30:39" (1/1) ... [2018-12-08 20:30:39,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:30:39" (1/1) ... [2018-12-08 20:30:39,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:30:39" (1/1) ... [2018-12-08 20:30:39,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:30:39,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:30:39,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:30:39,319 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:30:39,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:30:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:30:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 20:30:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 20:30:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 20:30:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 20:30:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-12-08 20:30:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-12-08 20:30:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-12-08 20:30:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-12-08 20:30:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-12-08 20:30:39,351 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-12-08 20:30:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:30:39,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:30:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 20:30:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 20:30:39,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 20:30:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 20:30:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-12-08 20:30:39,352 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-12-08 20:30:39,548 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:30:39,548 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-08 20:30:39,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:30:39 BoogieIcfgContainer [2018-12-08 20:30:39,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:30:39,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 20:30:39,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 20:30:39,551 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 20:30:39,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:30:39" (1/3) ... [2018-12-08 20:30:39,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f66ea46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:30:39, skipping insertion in model container [2018-12-08 20:30:39,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:30:39" (2/3) ... [2018-12-08 20:30:39,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f66ea46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:30:39, skipping insertion in model container [2018-12-08 20:30:39,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:30:39" (3/3) ... [2018-12-08 20:30:39,553 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_true-valid-memsafety.c [2018-12-08 20:30:39,559 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 20:30:39,563 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-12-08 20:30:39,573 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-12-08 20:30:39,589 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 20:30:39,589 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 20:30:39,589 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 20:30:39,589 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:30:39,589 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:30:39,589 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 20:30:39,589 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:30:39,589 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 20:30:39,599 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-12-08 20:30:39,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 20:30:39,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:39,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:39,606 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:39,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:39,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1830459948, now seen corresponding path program 1 times [2018-12-08 20:30:39,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:39,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:39,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:39,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:39,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:39,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:30:39,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 20:30:39,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:39,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:30:39,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:30:39,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:30:39,749 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2018-12-08 20:30:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:39,789 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-12-08 20:30:39,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:30:39,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-08 20:30:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:39,795 INFO L225 Difference]: With dead ends: 68 [2018-12-08 20:30:39,795 INFO L226 Difference]: Without dead ends: 63 [2018-12-08 20:30:39,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:30:39,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-08 20:30:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-08 20:30:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-08 20:30:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-12-08 20:30:39,818 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 12 [2018-12-08 20:30:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:39,818 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-12-08 20:30:39,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:30:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-12-08 20:30:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 20:30:39,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:39,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:39,819 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:39,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:39,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1830459949, now seen corresponding path program 1 times [2018-12-08 20:30:39,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:39,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:39,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:39,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:39,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:39,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:30:39,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:30:39,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:39,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:30:39,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:30:39,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:30:39,928 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2018-12-08 20:30:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:39,993 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-12-08 20:30:39,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:30:39,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-08 20:30:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:39,994 INFO L225 Difference]: With dead ends: 66 [2018-12-08 20:30:39,994 INFO L226 Difference]: Without dead ends: 66 [2018-12-08 20:30:39,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:30:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-08 20:30:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-12-08 20:30:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-08 20:30:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-12-08 20:30:40,001 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2018-12-08 20:30:40,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:40,001 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-12-08 20:30:40,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:30:40,001 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-12-08 20:30:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 20:30:40,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:40,002 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:40,002 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:40,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:40,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1967365176, now seen corresponding path program 1 times [2018-12-08 20:30:40,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:40,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:40,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:40,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:40,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:40,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:40,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:40,104 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-08 20:30:40,105 INFO L205 CegarAbsIntRunner]: [0], [1], [99], [107], [108], [110], [112], [118], [120], [122], [124], [125], [126], [128] [2018-12-08 20:30:40,124 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:30:40,125 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:30:40,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:30:40,248 INFO L272 AbstractInterpreter]: Visited 14 different actions 30 times. Merged at 4 different actions 16 times. Never widened. Performed 432 root evaluator evaluations with a maximum evaluation depth of 4. Performed 432 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-12-08 20:30:40,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:40,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:30:40,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:40,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:40,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:40,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:30:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:40,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:40,331 INFO L478 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-12-08 20:30:40,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,362 INFO L478 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-12-08 20:30:40,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,424 INFO L478 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-12-08 20:30:40,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,498 INFO L478 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 76 [2018-12-08 20:30:40,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,590 INFO L478 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-12-08 20:30:40,591 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,627 INFO L478 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-12-08 20:30:40,628 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,661 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 20:30:40,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,707 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-08 20:30:40,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-08 20:30:40,741 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,754 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,793 INFO L478 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 45 treesize of output 55 [2018-12-08 20:30:40,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,816 INFO L478 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 59 [2018-12-08 20:30:40,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,847 INFO L478 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 41 [2018-12-08 20:30:40,848 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,860 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,869 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,910 INFO L478 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-12-08 20:30:40,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 20:30:40,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-08 20:30:40,918 INFO L478 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 51 [2018-12-08 20:30:40,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:40,922 INFO L478 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 27 treesize of output 72 [2018-12-08 20:30:40,923 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,937 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,947 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,952 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,957 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:40,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 20:30:40,986 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-08 20:30:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:41,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:41,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:30:41,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2018-12-08 20:30:41,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:30:41,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:30:41,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:30:41,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:30:41,148 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 10 states. [2018-12-08 20:30:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:41,306 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-08 20:30:41,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:30:41,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-12-08 20:30:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:41,307 INFO L225 Difference]: With dead ends: 69 [2018-12-08 20:30:41,307 INFO L226 Difference]: Without dead ends: 69 [2018-12-08 20:30:41,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-12-08 20:30:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-08 20:30:41,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-08 20:30:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-08 20:30:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-12-08 20:30:41,311 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2018-12-08 20:30:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:41,311 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-12-08 20:30:41,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:30:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-12-08 20:30:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 20:30:41,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:41,312 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:41,312 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:41,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash 189347113, now seen corresponding path program 1 times [2018-12-08 20:30:41,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:41,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:41,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:41,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:41,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 20:30:41,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:30:41,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:30:41,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:41,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:30:41,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:30:41,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:30:41,353 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2018-12-08 20:30:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:41,420 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-12-08 20:30:41,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:30:41,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-08 20:30:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:41,421 INFO L225 Difference]: With dead ends: 68 [2018-12-08 20:30:41,421 INFO L226 Difference]: Without dead ends: 68 [2018-12-08 20:30:41,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:30:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-08 20:30:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-08 20:30:41,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-08 20:30:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-12-08 20:30:41,424 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 26 [2018-12-08 20:30:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:41,424 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-12-08 20:30:41,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:30:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-12-08 20:30:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 20:30:41,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:41,425 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:41,425 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:41,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:41,425 INFO L82 PathProgramCache]: Analyzing trace with hash 189347114, now seen corresponding path program 1 times [2018-12-08 20:30:41,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:41,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:41,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:41,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:41,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:41,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:41,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:41,463 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-08 20:30:41,463 INFO L205 CegarAbsIntRunner]: [0], [1], [27], [35], [38], [99], [105], [107], [108], [112], [116], [117], [118], [120], [121], [122], [124], [125], [126], [128] [2018-12-08 20:30:41,464 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:30:41,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:30:41,508 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:30:41,508 INFO L272 AbstractInterpreter]: Visited 20 different actions 39 times. Merged at 6 different actions 15 times. Widened at 1 different actions 1 times. Performed 439 root evaluator evaluations with a maximum evaluation depth of 4. Performed 439 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 35 variables. [2018-12-08 20:30:41,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:41,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:30:41,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:41,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:41,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:41,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:30:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:41,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:41,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:41,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:30:41,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-08 20:30:41,620 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:30:41,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:30:41,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:30:41,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:30:41,621 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 7 states. [2018-12-08 20:30:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:41,635 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-08 20:30:41,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:30:41,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-08 20:30:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:41,636 INFO L225 Difference]: With dead ends: 73 [2018-12-08 20:30:41,636 INFO L226 Difference]: Without dead ends: 73 [2018-12-08 20:30:41,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:30:41,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-08 20:30:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-12-08 20:30:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-08 20:30:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-12-08 20:30:41,639 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 26 [2018-12-08 20:30:41,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:41,639 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-12-08 20:30:41,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:30:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-12-08 20:30:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 20:30:41,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:41,639 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:41,639 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:41,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:41,640 INFO L82 PathProgramCache]: Analyzing trace with hash -378498171, now seen corresponding path program 2 times [2018-12-08 20:30:41,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:41,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:41,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:41,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:41,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:41,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:41,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:41,674 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 20:30:41,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 20:30:41,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:41,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:41,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 20:30:41,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 20:30:41,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 20:30:41,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:30:41,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:41,703 INFO L478 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-12-08 20:30:41,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,706 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 20:30:41,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-08 20:30:41,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,716 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-08 20:30:41,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,723 INFO L478 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 27 treesize of output 72 [2018-12-08 20:30:41,723 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:41,742 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:41,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:41,763 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:41,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:41,787 INFO L478 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-12-08 20:30:41,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,806 INFO L478 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-12-08 20:30:41,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,855 INFO L478 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-12-08 20:30:41,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,880 INFO L478 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 62 [2018-12-08 20:30:41,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,906 INFO L478 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-12-08 20:30:41,906 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:41,920 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:41,928 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:41,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,952 INFO L478 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-12-08 20:30:41,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:41,997 INFO L478 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 66 [2018-12-08 20:30:42,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,023 INFO L478 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-12-08 20:30:42,024 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:42,034 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:42,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,058 INFO L478 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 76 [2018-12-08 20:30:42,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,125 INFO L478 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-12-08 20:30:42,125 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:42,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:42,154 INFO L478 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-12-08 20:30:42,154 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:42,167 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:42,183 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 20:30:42,195 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:42,200 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:42,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 20:30:42,213 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-08 20:30:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 20:30:42,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:42,444 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-08 20:30:42,497 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-08 20:30:42,503 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-08 20:30:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 20:30:42,584 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:30:42,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2018-12-08 20:30:42,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:42,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:30:42,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:30:42,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-12-08 20:30:42,585 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 7 states. [2018-12-08 20:30:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:42,780 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-08 20:30:42,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:30:42,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-12-08 20:30:42,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:42,781 INFO L225 Difference]: With dead ends: 71 [2018-12-08 20:30:42,781 INFO L226 Difference]: Without dead ends: 71 [2018-12-08 20:30:42,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-12-08 20:30:42,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-08 20:30:42,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-08 20:30:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-08 20:30:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-12-08 20:30:42,783 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 29 [2018-12-08 20:30:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:42,783 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-12-08 20:30:42,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:30:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-12-08 20:30:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 20:30:42,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:42,784 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:42,784 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:42,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:42,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1151458565, now seen corresponding path program 1 times [2018-12-08 20:30:42,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:42,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:42,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:30:42,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:42,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:42,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:42,820 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:42,820 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-08 20:30:42,820 INFO L205 CegarAbsIntRunner]: [0], [1], [27], [35], [36], [40], [99], [105], [107], [108], [112], [116], [117], [118], [120], [121], [122], [124], [125], [126], [128] [2018-12-08 20:30:42,821 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:30:42,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:30:42,875 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:30:42,876 INFO L272 AbstractInterpreter]: Visited 21 different actions 40 times. Merged at 6 different actions 15 times. Widened at 1 different actions 1 times. Performed 446 root evaluator evaluations with a maximum evaluation depth of 4. Performed 446 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 36 variables. [2018-12-08 20:30:42,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:42,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:30:42,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:42,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:42,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:42,886 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:30:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:42,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:42,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:42,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:30:42,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-08 20:30:42,978 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:30:42,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 20:30:42,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 20:30:42,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:30:42,979 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 8 states. [2018-12-08 20:30:43,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:43,003 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-12-08 20:30:43,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:30:43,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-08 20:30:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:43,004 INFO L225 Difference]: With dead ends: 76 [2018-12-08 20:30:43,004 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 20:30:43,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 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-12-08 20:30:43,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 20:30:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-12-08 20:30:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-08 20:30:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-12-08 20:30:43,007 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 30 [2018-12-08 20:30:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:43,007 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-12-08 20:30:43,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 20:30:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-12-08 20:30:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 20:30:43,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:43,008 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:43,009 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:43,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:43,009 INFO L82 PathProgramCache]: Analyzing trace with hash -387148320, now seen corresponding path program 2 times [2018-12-08 20:30:43,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:43,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:43,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:43,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:43,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:43,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:43,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:43,043 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 20:30:43,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 20:30:43,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:43,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:43,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 20:30:43,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 20:30:43,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 20:30:43,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:30:43,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:43,070 INFO L478 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 84 treesize of output 74 [2018-12-08 20:30:43,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,093 INFO L478 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 71 treesize of output 78 [2018-12-08 20:30:43,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,173 INFO L478 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 65 treesize of output 80 [2018-12-08 20:30:43,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,254 INFO L478 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 55 treesize of output 75 [2018-12-08 20:30:43,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2018-12-08 20:30:43,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 75 [2018-12-08 20:30:43,285 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:43,300 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:43,314 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:43,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,360 INFO L478 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 53 treesize of output 85 [2018-12-08 20:30:43,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 85 [2018-12-08 20:30:43,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 75 [2018-12-08 20:30:43,449 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:43,465 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:43,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 99 [2018-12-08 20:30:43,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 97 [2018-12-08 20:30:43,517 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-08 20:30:43,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 55 treesize of output 83 [2018-12-08 20:30:43,597 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:43,652 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 20:30:43,722 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 20:30:43,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-08 20:30:43,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,900 INFO L478 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 63 treesize of output 70 [2018-12-08 20:30:43,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,936 INFO L478 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 44 treesize of output 71 [2018-12-08 20:30:43,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:43,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2018-12-08 20:30:43,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 75 [2018-12-08 20:30:43,976 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:43,995 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:44,013 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:44,032 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:44,183 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 20:30:44,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 20:30:44,379 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-12-08 20:30:44,379 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2018-12-08 20:30:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-08 20:30:44,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-08 20:30:44,608 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:30:44,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [8] total 10 [2018-12-08 20:30:44,608 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:44,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:30:44,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:30:44,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:30:44,609 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 3 states. [2018-12-08 20:30:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:44,634 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-08 20:30:44,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:30:44,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-08 20:30:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:44,635 INFO L225 Difference]: With dead ends: 73 [2018-12-08 20:30:44,635 INFO L226 Difference]: Without dead ends: 73 [2018-12-08 20:30:44,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:30:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-08 20:30:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-08 20:30:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-08 20:30:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-12-08 20:30:44,639 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 33 [2018-12-08 20:30:44,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:44,639 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-12-08 20:30:44,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:30:44,639 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-12-08 20:30:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 20:30:44,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:44,640 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:44,640 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:44,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash -387148319, now seen corresponding path program 1 times [2018-12-08 20:30:44,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:44,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:30:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:44,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:44,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:44,685 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:44,686 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-12-08 20:30:44,686 INFO L205 CegarAbsIntRunner]: [0], [1], [27], [35], [36], [41], [99], [105], [107], [108], [112], [116], [117], [118], [120], [121], [122], [124], [125], [126], [128] [2018-12-08 20:30:44,686 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:30:44,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:30:44,730 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:30:44,730 INFO L272 AbstractInterpreter]: Visited 21 different actions 40 times. Merged at 6 different actions 15 times. Widened at 1 different actions 1 times. Performed 447 root evaluator evaluations with a maximum evaluation depth of 4. Performed 447 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 36 variables. [2018-12-08 20:30:44,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:44,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:30:44,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:44,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:44,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:44,739 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:30:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:44,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:44,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:44,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:30:44,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-12-08 20:30:44,854 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:30:44,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:30:44,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:30:44,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:30:44,854 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 9 states. [2018-12-08 20:30:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:44,875 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-12-08 20:30:44,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 20:30:44,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-08 20:30:44,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:44,876 INFO L225 Difference]: With dead ends: 78 [2018-12-08 20:30:44,876 INFO L226 Difference]: Without dead ends: 78 [2018-12-08 20:30:44,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 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-12-08 20:30:44,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-08 20:30:44,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-12-08 20:30:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-08 20:30:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-12-08 20:30:44,880 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 33 [2018-12-08 20:30:44,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:44,880 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-12-08 20:30:44,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:30:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-12-08 20:30:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 20:30:44,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:44,880 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:44,881 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:44,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:44,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1133876442, now seen corresponding path program 2 times [2018-12-08 20:30:44,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:44,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:44,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:44,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:44,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:30:44,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:44,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:44,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 20:30:44,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 20:30:44,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:44,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:44,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 20:30:44,937 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 20:30:44,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 20:30:44,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:30:44,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:44,955 INFO L478 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-12-08 20:30:44,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:44,958 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 20:30:44,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:44,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:44,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-08 20:30:44,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:44,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:44,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:44,966 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-08 20:30:44,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:44,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:44,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:44,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:44,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:44,972 INFO L478 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 27 treesize of output 72 [2018-12-08 20:30:44,972 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:44,988 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:44,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:45,001 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:45,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:45,018 INFO L478 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-12-08 20:30:45,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,032 INFO L478 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-12-08 20:30:45,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,082 INFO L478 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-12-08 20:30:45,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,138 INFO L478 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 66 [2018-12-08 20:30:45,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,165 INFO L478 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-12-08 20:30:45,165 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:45,176 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:45,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,212 INFO L478 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 76 [2018-12-08 20:30:45,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,272 INFO L478 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-12-08 20:30:45,273 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:45,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,306 INFO L478 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 39 treesize of output 53 [2018-12-08 20:30:45,306 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:45,328 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 20:30:45,342 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 20:30:45,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,362 INFO L478 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 45 treesize of output 55 [2018-12-08 20:30:45,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,381 INFO L478 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 59 [2018-12-08 20:30:45,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:45,403 INFO L478 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 41 [2018-12-08 20:30:45,403 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:45,413 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:45,418 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:45,426 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:45,431 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:45,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 20:30:45,448 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-08 20:30:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-08 20:30:45,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-08 20:30:45,651 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:30:45,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [9] total 15 [2018-12-08 20:30:45,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:45,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:30:45,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:30:45,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-08 20:30:45,652 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 5 states. [2018-12-08 20:30:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:45,697 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-12-08 20:30:45,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:30:45,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-12-08 20:30:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:45,698 INFO L225 Difference]: With dead ends: 75 [2018-12-08 20:30:45,698 INFO L226 Difference]: Without dead ends: 75 [2018-12-08 20:30:45,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-08 20:30:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-08 20:30:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-08 20:30:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-08 20:30:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-12-08 20:30:45,700 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 36 [2018-12-08 20:30:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:45,700 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-12-08 20:30:45,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:30:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-12-08 20:30:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 20:30:45,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:45,701 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:45,701 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:45,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:45,701 INFO L82 PathProgramCache]: Analyzing trace with hash -69292150, now seen corresponding path program 1 times [2018-12-08 20:30:45,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:45,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:45,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:30:45,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:45,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-08 20:30:45,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:30:45,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:30:45,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:45,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:30:45,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:30:45,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:30:45,730 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 6 states. [2018-12-08 20:30:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:45,794 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-12-08 20:30:45,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:30:45,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-12-08 20:30:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:45,795 INFO L225 Difference]: With dead ends: 74 [2018-12-08 20:30:45,795 INFO L226 Difference]: Without dead ends: 74 [2018-12-08 20:30:45,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:30:45,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-08 20:30:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-08 20:30:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-08 20:30:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-12-08 20:30:45,798 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 45 [2018-12-08 20:30:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:45,798 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-12-08 20:30:45,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:30:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-12-08 20:30:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 20:30:45,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:45,799 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:45,800 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:45,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:45,800 INFO L82 PathProgramCache]: Analyzing trace with hash -69292149, now seen corresponding path program 1 times [2018-12-08 20:30:45,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:45,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:45,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:45,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:45,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:30:45,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:45,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:45,841 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-08 20:30:45,841 INFO L205 CegarAbsIntRunner]: [0], [1], [3], [11], [14], [27], [33], [35], [36], [39], [42], [44], [48], [49], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [124], [125], [126], [128] [2018-12-08 20:30:45,842 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:30:45,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:30:45,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:30:45,890 INFO L272 AbstractInterpreter]: Visited 30 different actions 60 times. Merged at 8 different actions 24 times. Never widened. Performed 541 root evaluator evaluations with a maximum evaluation depth of 4. Performed 541 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 4 different actions. Largest state had 39 variables. [2018-12-08 20:30:45,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:45,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:30:45,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:45,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:45,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:45,900 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:30:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:45,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:30:45,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:30:46,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:30:46,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-12-08 20:30:46,006 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:30:46,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:30:46,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:30:46,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:30:46,007 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 10 states. [2018-12-08 20:30:46,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:46,026 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-12-08 20:30:46,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:30:46,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-12-08 20:30:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:46,026 INFO L225 Difference]: With dead ends: 79 [2018-12-08 20:30:46,027 INFO L226 Difference]: Without dead ends: 79 [2018-12-08 20:30:46,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 83 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-12-08 20:30:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-08 20:30:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-12-08 20:30:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-08 20:30:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-12-08 20:30:46,029 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 45 [2018-12-08 20:30:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:46,029 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-12-08 20:30:46,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:30:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-12-08 20:30:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 20:30:46,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:46,030 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:46,030 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:46,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:46,030 INFO L82 PathProgramCache]: Analyzing trace with hash -912931504, now seen corresponding path program 2 times [2018-12-08 20:30:46,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:46,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:46,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:46,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:46,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:30:46,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:46,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:46,068 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 20:30:46,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 20:30:46,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:46,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:46,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 20:30:46,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 20:30:46,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 20:30:46,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:30:46,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:46,094 INFO L478 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-12-08 20:30:46,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,098 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 20:30:46,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-08 20:30:46,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,115 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-08 20:30:46,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,121 INFO L478 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 27 treesize of output 72 [2018-12-08 20:30:46,121 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,136 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,149 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,167 INFO L478 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-12-08 20:30:46,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,190 INFO L478 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-12-08 20:30:46,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,231 INFO L478 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-12-08 20:30:46,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,253 INFO L478 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 62 [2018-12-08 20:30:46,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,277 INFO L478 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-12-08 20:30:46,277 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,285 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,291 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,315 INFO L478 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-12-08 20:30:46,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,367 INFO L478 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 76 [2018-12-08 20:30:46,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,426 INFO L478 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-12-08 20:30:46,427 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,459 INFO L478 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 39 treesize of output 53 [2018-12-08 20:30:46,459 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,477 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 20:30:46,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,498 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-08 20:30:46,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:46,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-08 20:30:46,523 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,531 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,541 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,550 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,555 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:46,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 20:30:46,565 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-08 20:30:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-08 20:30:46,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:46,786 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-08 20:30:46,843 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-12-08 20:30:46,876 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-08 20:30:46,897 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-12-08 20:30:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-08 20:30:46,985 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:30:46,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 20 [2018-12-08 20:30:46,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:46,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:30:46,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:30:46,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-12-08 20:30:46,986 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-12-08 20:30:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:47,195 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-12-08 20:30:47,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:30:47,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-12-08 20:30:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:47,196 INFO L225 Difference]: With dead ends: 77 [2018-12-08 20:30:47,196 INFO L226 Difference]: Without dead ends: 77 [2018-12-08 20:30:47,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-12-08 20:30:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-08 20:30:47,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-08 20:30:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-08 20:30:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-12-08 20:30:47,198 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 48 [2018-12-08 20:30:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:47,199 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-12-08 20:30:47,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:30:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-12-08 20:30:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 20:30:47,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:47,199 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:47,199 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:47,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:47,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1763894402, now seen corresponding path program 1 times [2018-12-08 20:30:47,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:47,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:47,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:30:47,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:47,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:30:47,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:47,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:47,247 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-12-08 20:30:47,247 INFO L205 CegarAbsIntRunner]: [0], [1], [3], [11], [12], [16], [27], [33], [35], [36], [39], [42], [44], [48], [49], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [124], [125], [126], [128] [2018-12-08 20:30:47,248 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:30:47,248 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:30:47,283 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:30:47,283 INFO L272 AbstractInterpreter]: Visited 31 different actions 70 times. Merged at 11 different actions 32 times. Widened at 1 different actions 1 times. Performed 600 root evaluator evaluations with a maximum evaluation depth of 4. Performed 600 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 5 different actions. Largest state had 39 variables. [2018-12-08 20:30:47,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:47,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:30:47,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:47,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:47,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:47,290 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:30:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:47,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:30:47,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:30:47,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:30:47,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-12-08 20:30:47,372 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:30:47,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 20:30:47,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 20:30:47,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:30:47,373 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 11 states. [2018-12-08 20:30:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:47,392 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-12-08 20:30:47,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 20:30:47,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-12-08 20:30:47,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:47,393 INFO L225 Difference]: With dead ends: 82 [2018-12-08 20:30:47,393 INFO L226 Difference]: Without dead ends: 82 [2018-12-08 20:30:47,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:30:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-08 20:30:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-12-08 20:30:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-08 20:30:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-12-08 20:30:47,395 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 49 [2018-12-08 20:30:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:47,395 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-12-08 20:30:47,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 20:30:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-12-08 20:30:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 20:30:47,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:47,395 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:47,395 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:47,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:47,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1239445561, now seen corresponding path program 2 times [2018-12-08 20:30:47,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:47,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:47,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:47,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:47,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:30:47,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:47,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:47,445 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 20:30:47,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 20:30:47,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:47,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:47,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 20:30:47,451 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 20:30:47,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 20:30:47,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:30:47,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:47,470 INFO L478 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 84 treesize of output 74 [2018-12-08 20:30:47,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,492 INFO L478 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 71 treesize of output 78 [2018-12-08 20:30:47,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,559 INFO L478 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 65 treesize of output 80 [2018-12-08 20:30:47,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,641 INFO L478 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 55 treesize of output 75 [2018-12-08 20:30:47,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2018-12-08 20:30:47,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 75 [2018-12-08 20:30:47,672 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:47,686 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:47,700 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:47,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,741 INFO L478 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 53 treesize of output 85 [2018-12-08 20:30:47,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 85 [2018-12-08 20:30:47,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 75 [2018-12-08 20:30:47,835 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:47,850 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:47,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 99 [2018-12-08 20:30:47,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 93 treesize of output 87 [2018-12-08 20:30:47,895 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:47,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:47,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 97 [2018-12-08 20:30:47,956 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-08 20:30:48,023 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 20:30:48,088 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 20:30:48,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-08 20:30:48,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:48,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:48,267 INFO L478 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 63 treesize of output 70 [2018-12-08 20:30:48,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:48,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:48,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:48,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:48,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:48,300 INFO L478 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 44 treesize of output 71 [2018-12-08 20:30:48,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:48,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:48,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:48,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:48,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:48,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:48,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2018-12-08 20:30:48,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 75 [2018-12-08 20:30:48,330 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:48,344 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:48,356 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:48,370 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:48,461 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 20:30:48,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 20:30:48,654 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-12-08 20:30:48,655 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2018-12-08 20:30:50,746 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 202 DAG size of output: 112 [2018-12-08 20:30:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-08 20:30:50,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-08 20:30:50,986 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:30:50,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [11] total 13 [2018-12-08 20:30:50,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:50,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:30:50,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:30:50,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:30:50,987 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 3 states. [2018-12-08 20:30:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:51,007 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-12-08 20:30:51,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:30:51,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-08 20:30:51,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:51,008 INFO L225 Difference]: With dead ends: 79 [2018-12-08 20:30:51,008 INFO L226 Difference]: Without dead ends: 79 [2018-12-08 20:30:51,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:30:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-08 20:30:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-08 20:30:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-08 20:30:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-12-08 20:30:51,009 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 52 [2018-12-08 20:30:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:51,010 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-12-08 20:30:51,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:30:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-12-08 20:30:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 20:30:51,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:51,010 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:51,010 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:51,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:51,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1239445560, now seen corresponding path program 1 times [2018-12-08 20:30:51,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:51,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:51,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:30:51,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:51,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:30:51,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:51,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:51,062 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-12-08 20:30:51,063 INFO L205 CegarAbsIntRunner]: [0], [1], [3], [11], [12], [17], [27], [33], [35], [36], [39], [42], [44], [48], [49], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [124], [125], [126], [128] [2018-12-08 20:30:51,063 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:30:51,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:30:51,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:30:51,101 INFO L272 AbstractInterpreter]: Visited 31 different actions 77 times. Merged at 14 different actions 38 times. Widened at 2 different actions 2 times. Performed 637 root evaluator evaluations with a maximum evaluation depth of 4. Performed 637 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 6 different actions. Largest state had 39 variables. [2018-12-08 20:30:51,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:51,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:30:51,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:51,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:51,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:51,112 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:30:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:51,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:30:51,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:30:51,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:30:51,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-12-08 20:30:51,214 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:30:51,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 20:30:51,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 20:30:51,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:30:51,215 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 12 states. [2018-12-08 20:30:51,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:51,237 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-12-08 20:30:51,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 20:30:51,238 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-12-08 20:30:51,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:51,238 INFO L225 Difference]: With dead ends: 84 [2018-12-08 20:30:51,238 INFO L226 Difference]: Without dead ends: 84 [2018-12-08 20:30:51,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 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-12-08 20:30:51,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-08 20:30:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-12-08 20:30:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-08 20:30:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-12-08 20:30:51,241 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 52 [2018-12-08 20:30:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:51,241 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-12-08 20:30:51,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 20:30:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-12-08 20:30:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 20:30:51,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:51,242 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:51,242 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:51,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:51,242 INFO L82 PathProgramCache]: Analyzing trace with hash -981573021, now seen corresponding path program 2 times [2018-12-08 20:30:51,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:51,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:51,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:51,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:51,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 20:30:51,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:51,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:51,307 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 20:30:51,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 20:30:51,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:51,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:51,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 20:30:51,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 20:30:51,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 20:30:51,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:30:51,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:51,333 INFO L478 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-12-08 20:30:51,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,335 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 20:30:51,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-08 20:30:51,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,342 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-08 20:30:51,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,347 INFO L478 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 27 treesize of output 72 [2018-12-08 20:30:51,348 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,361 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,394 INFO L478 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-12-08 20:30:51,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,408 INFO L478 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-12-08 20:30:51,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,450 INFO L478 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-12-08 20:30:51,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,495 INFO L478 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 66 [2018-12-08 20:30:51,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,520 INFO L478 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-12-08 20:30:51,520 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,530 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,561 INFO L478 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 76 [2018-12-08 20:30:51,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,621 INFO L478 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-12-08 20:30:51,621 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,649 INFO L478 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-12-08 20:30:51,649 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,661 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,675 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 20:30:51,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,694 INFO L478 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 45 treesize of output 55 [2018-12-08 20:30:51,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,713 INFO L478 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 59 [2018-12-08 20:30:51,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:51,735 INFO L478 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 41 [2018-12-08 20:30:51,735 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,745 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,750 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,764 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,769 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:51,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 20:30:51,779 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-08 20:30:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-08 20:30:51,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-08 20:30:52,000 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:30:52,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [12] total 18 [2018-12-08 20:30:52,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:52,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:30:52,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:30:52,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-12-08 20:30:52,001 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 5 states. [2018-12-08 20:30:52,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:52,052 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-12-08 20:30:52,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:30:52,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-08 20:30:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:52,052 INFO L225 Difference]: With dead ends: 81 [2018-12-08 20:30:52,052 INFO L226 Difference]: Without dead ends: 81 [2018-12-08 20:30:52,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-12-08 20:30:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-08 20:30:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-08 20:30:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-08 20:30:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-12-08 20:30:52,054 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 55 [2018-12-08 20:30:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:52,055 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-12-08 20:30:52,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:30:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-12-08 20:30:52,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 20:30:52,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:52,056 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:52,056 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:52,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:52,056 INFO L82 PathProgramCache]: Analyzing trace with hash -965711231, now seen corresponding path program 1 times [2018-12-08 20:30:52,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:52,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:52,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:30:52,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:52,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-08 20:30:52,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:30:52,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:30:52,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:52,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:30:52,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:30:52,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:30:52,095 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 6 states. [2018-12-08 20:30:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:52,144 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-12-08 20:30:52,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:30:52,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-08 20:30:52,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:52,145 INFO L225 Difference]: With dead ends: 80 [2018-12-08 20:30:52,145 INFO L226 Difference]: Without dead ends: 80 [2018-12-08 20:30:52,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:30:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-08 20:30:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-08 20:30:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-08 20:30:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-12-08 20:30:52,147 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 64 [2018-12-08 20:30:52,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:52,148 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-12-08 20:30:52,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:30:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-12-08 20:30:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 20:30:52,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:52,148 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:52,148 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:52,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:52,149 INFO L82 PathProgramCache]: Analyzing trace with hash -965711230, now seen corresponding path program 1 times [2018-12-08 20:30:52,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:52,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:52,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:52,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:52,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 20:30:52,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:52,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:52,213 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-12-08 20:30:52,214 INFO L205 CegarAbsIntRunner]: [0], [1], [3], [9], [11], [12], [15], [18], [20], [24], [25], [27], [33], [35], [36], [39], [42], [44], [48], [49], [51], [59], [62], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [123], [124], [125], [126], [128] [2018-12-08 20:30:52,214 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:30:52,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:30:52,265 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:30:52,265 INFO L272 AbstractInterpreter]: Visited 40 different actions 97 times. Merged at 16 different actions 47 times. Widened at 1 different actions 1 times. Performed 731 root evaluator evaluations with a maximum evaluation depth of 4. Performed 731 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 7 different actions. Largest state had 39 variables. [2018-12-08 20:30:52,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:52,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:30:52,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:52,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:52,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:52,280 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:30:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:52,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 20:30:52,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 20:30:52,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:30:52,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-12-08 20:30:52,382 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:30:52,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 20:30:52,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 20:30:52,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:30:52,382 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 13 states. [2018-12-08 20:30:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:52,404 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-08 20:30:52,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:30:52,404 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2018-12-08 20:30:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:52,404 INFO L225 Difference]: With dead ends: 83 [2018-12-08 20:30:52,404 INFO L226 Difference]: Without dead ends: 83 [2018-12-08 20:30:52,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 118 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-12-08 20:30:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-08 20:30:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-08 20:30:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-08 20:30:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-12-08 20:30:52,406 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 64 [2018-12-08 20:30:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:52,406 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-12-08 20:30:52,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 20:30:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-12-08 20:30:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 20:30:52,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:52,406 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:52,407 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:52,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:52,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1653003107, now seen corresponding path program 2 times [2018-12-08 20:30:52,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:52,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:52,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:52,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:52,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 20:30:52,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:52,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:52,423 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 20:30:52,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 20:30:52,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:52,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:52,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 20:30:52,431 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 20:30:52,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 20:30:52,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:30:52,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:52,452 INFO L478 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-12-08 20:30:52,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,470 INFO L478 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-12-08 20:30:52,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,508 INFO L478 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-12-08 20:30:52,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,530 INFO L478 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 62 [2018-12-08 20:30:52,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,557 INFO L478 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-12-08 20:30:52,557 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,611 INFO L478 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-12-08 20:30:52,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,667 INFO L478 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 76 [2018-12-08 20:30:52,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,729 INFO L478 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-12-08 20:30:52,729 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,764 INFO L478 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-12-08 20:30:52,764 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,798 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 20:30:52,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,833 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-08 20:30:52,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-08 20:30:52,859 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,870 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,891 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,910 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,934 INFO L478 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-12-08 20:30:52,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 20:30:52,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-08 20:30:52,939 INFO L478 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 51 [2018-12-08 20:30:52,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:52,941 INFO L478 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 27 treesize of output 72 [2018-12-08 20:30:52,941 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,954 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,960 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,965 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,971 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:52,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 20:30:52,987 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-08 20:30:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-08 20:30:53,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:53,196 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-08 20:30:53,232 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-08 20:30:53,235 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-08 20:30:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-08 20:30:53,301 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:30:53,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [4] total 14 [2018-12-08 20:30:53,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:53,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:30:53,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:30:53,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:30:53,301 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 7 states. [2018-12-08 20:30:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:53,457 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-08 20:30:53,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:30:53,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-12-08 20:30:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:53,457 INFO L225 Difference]: With dead ends: 83 [2018-12-08 20:30:53,457 INFO L226 Difference]: Without dead ends: 83 [2018-12-08 20:30:53,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-12-08 20:30:53,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-08 20:30:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-08 20:30:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-08 20:30:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-12-08 20:30:53,459 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2018-12-08 20:30:53,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:53,460 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-12-08 20:30:53,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:30:53,460 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-12-08 20:30:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 20:30:53,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:53,460 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:53,460 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:53,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:53,461 INFO L82 PathProgramCache]: Analyzing trace with hash 296511237, now seen corresponding path program 1 times [2018-12-08 20:30:53,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:53,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:53,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:30:53,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:53,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 20:30:53,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:53,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:53,477 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-12-08 20:30:53,478 INFO L205 CegarAbsIntRunner]: [0], [1], [3], [9], [11], [12], [15], [18], [20], [24], [25], [27], [33], [35], [36], [39], [42], [44], [48], [49], [51], [59], [60], [64], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [123], [124], [125], [126], [128] [2018-12-08 20:30:53,479 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:30:53,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:30:53,529 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:30:53,529 INFO L272 AbstractInterpreter]: Visited 41 different actions 105 times. Merged at 19 different actions 53 times. Widened at 2 different actions 2 times. Performed 774 root evaluator evaluations with a maximum evaluation depth of 4. Performed 774 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 8 different actions. Largest state had 39 variables. [2018-12-08 20:30:53,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:53,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:30:53,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:53,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:53,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:53,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:30:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:53,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 20:30:53,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 20:30:53,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:30:53,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-08 20:30:53,619 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:30:53,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:30:53,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:30:53,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:30:53,619 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 5 states. [2018-12-08 20:30:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:53,643 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-12-08 20:30:53,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:30:53,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-08 20:30:53,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:53,644 INFO L225 Difference]: With dead ends: 92 [2018-12-08 20:30:53,644 INFO L226 Difference]: Without dead ends: 92 [2018-12-08 20:30:53,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 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-12-08 20:30:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-08 20:30:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-12-08 20:30:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-08 20:30:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-12-08 20:30:53,645 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 68 [2018-12-08 20:30:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:53,645 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-12-08 20:30:53,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:30:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-12-08 20:30:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 20:30:53,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:53,646 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2018-12-08 20:30:53,646 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:53,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:53,646 INFO L82 PathProgramCache]: Analyzing trace with hash 725066785, now seen corresponding path program 2 times [2018-12-08 20:30:53,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:53,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:53,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:53,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:53,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 20:30:53,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:53,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:53,666 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 20:30:53,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 20:30:53,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:53,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:53,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 20:30:53,677 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 20:30:53,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 20:30:53,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:30:53,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:53,701 INFO L478 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 42 treesize of output 41 [2018-12-08 20:30:53,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,718 INFO L478 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 41 treesize of output 44 [2018-12-08 20:30:53,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,734 INFO L478 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 40 treesize of output 47 [2018-12-08 20:30:53,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,749 INFO L478 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 43 treesize of output 50 [2018-12-08 20:30:53,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,816 INFO L478 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 45 treesize of output 73 [2018-12-08 20:30:53,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 57 [2018-12-08 20:30:53,820 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:53,833 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:53,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,870 INFO L478 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 75 [2018-12-08 20:30:53,873 INFO L478 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 0 case distinctions, treesize of input 69 treesize of output 73 [2018-12-08 20:30:53,874 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:53,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:53,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 73 [2018-12-08 20:30:53,932 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-08 20:30:53,977 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 20:30:54,021 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 20:30:54,083 INFO L478 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 41 treesize of output 44 [2018-12-08 20:30:54,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,109 INFO L478 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 30 treesize of output 58 [2018-12-08 20:30:54,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-12-08 20:30:54,113 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:54,122 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:54,131 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:54,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-08 20:30:54,248 INFO L478 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 38 treesize of output 37 [2018-12-08 20:30:54,251 INFO L478 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 34 treesize of output 33 [2018-12-08 20:30:54,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,265 INFO L478 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 30 treesize of output 54 [2018-12-08 20:30:54,270 INFO L478 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 0 case distinctions, treesize of input 38 treesize of output 49 [2018-12-08 20:30:54,270 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:54,278 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:54,286 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:54,294 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:54,353 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 20:30:54,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 20:30:54,468 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-12-08 20:30:54,468 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:42, output treesize:261 [2018-12-08 20:30:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-08 20:30:54,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-08 20:30:54,633 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:30:54,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 7 [2018-12-08 20:30:54,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:54,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:30:54,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:30:54,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:30:54,633 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 3 states. [2018-12-08 20:30:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:54,645 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-12-08 20:30:54,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:30:54,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-08 20:30:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:54,646 INFO L225 Difference]: With dead ends: 87 [2018-12-08 20:30:54,646 INFO L226 Difference]: Without dead ends: 87 [2018-12-08 20:30:54,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:30:54,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-08 20:30:54,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-08 20:30:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-08 20:30:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-12-08 20:30:54,649 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 73 [2018-12-08 20:30:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:54,649 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-12-08 20:30:54,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:30:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-12-08 20:30:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 20:30:54,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:54,650 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2018-12-08 20:30:54,650 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:54,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:54,650 INFO L82 PathProgramCache]: Analyzing trace with hash 725066786, now seen corresponding path program 1 times [2018-12-08 20:30:54,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:54,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:54,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:30:54,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:54,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 20:30:54,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:54,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:54,677 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-12-08 20:30:54,677 INFO L205 CegarAbsIntRunner]: [0], [1], [3], [9], [11], [12], [15], [18], [20], [24], [25], [27], [33], [35], [36], [39], [42], [44], [48], [49], [51], [59], [60], [65], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [123], [124], [125], [126], [128] [2018-12-08 20:30:54,678 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:30:54,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:30:54,724 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:30:54,724 INFO L272 AbstractInterpreter]: Visited 41 different actions 98 times. Merged at 16 different actions 47 times. Widened at 1 different actions 1 times. Performed 739 root evaluator evaluations with a maximum evaluation depth of 4. Performed 739 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 7 different actions. Largest state had 39 variables. [2018-12-08 20:30:54,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:54,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:30:54,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:54,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:54,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:54,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:30:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:54,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:54,769 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 20:30:54,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 20:30:54,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:30:54,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-08 20:30:54,806 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:30:54,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:30:54,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:30:54,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:30:54,806 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 6 states. [2018-12-08 20:30:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:54,819 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-12-08 20:30:54,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:30:54,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-08 20:30:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:54,819 INFO L225 Difference]: With dead ends: 96 [2018-12-08 20:30:54,820 INFO L226 Difference]: Without dead ends: 96 [2018-12-08 20:30:54,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 143 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-12-08 20:30:54,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-08 20:30:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-12-08 20:30:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-08 20:30:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-12-08 20:30:54,821 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 73 [2018-12-08 20:30:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:54,821 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-12-08 20:30:54,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:30:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-12-08 20:30:54,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 20:30:54,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:54,822 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:54,822 INFO L423 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:54,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:54,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1745733498, now seen corresponding path program 2 times [2018-12-08 20:30:54,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:54,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:54,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:54,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:54,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 20:30:54,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:54,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:54,850 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 20:30:54,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 20:30:54,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:54,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:54,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 20:30:54,857 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 20:30:54,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 20:30:54,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:30:54,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:54,881 INFO L478 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 46 treesize of output 42 [2018-12-08 20:30:54,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,897 INFO L478 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 39 treesize of output 52 [2018-12-08 20:30:54,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,938 INFO L478 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 39 treesize of output 60 [2018-12-08 20:30:54,946 INFO L478 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 56 treesize of output 59 [2018-12-08 20:30:54,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:54,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 40 [2018-12-08 20:30:54,990 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,023 INFO L478 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 38 treesize of output 41 [2018-12-08 20:30:55,023 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,047 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 20:30:55,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,080 INFO L478 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 31 treesize of output 46 [2018-12-08 20:30:55,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-08 20:30:55,099 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,107 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-12-08 20:30:55,146 INFO L478 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 35 treesize of output 42 [2018-12-08 20:30:55,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2018-12-08 20:30:55,164 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,172 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,179 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,193 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-08 20:30:55,214 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 20:30:55,216 INFO L478 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 23 treesize of output 37 [2018-12-08 20:30:55,219 INFO L478 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 25 treesize of output 39 [2018-12-08 20:30:55,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,222 INFO L478 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 60 [2018-12-08 20:30:55,223 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,232 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,241 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,258 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,271 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:55,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 20:30:55,284 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2018-12-08 20:30:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-12-08 20:30:55,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-12-08 20:30:55,527 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:30:55,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 12 [2018-12-08 20:30:55,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:55,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:30:55,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:30:55,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:30:55,527 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 5 states. [2018-12-08 20:30:55,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:55,566 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-08 20:30:55,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:30:55,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-08 20:30:55,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:55,567 INFO L225 Difference]: With dead ends: 91 [2018-12-08 20:30:55,567 INFO L226 Difference]: Without dead ends: 91 [2018-12-08 20:30:55,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:30:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-08 20:30:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-08 20:30:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 20:30:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-12-08 20:30:55,569 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 78 [2018-12-08 20:30:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:55,569 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-12-08 20:30:55,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:30:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-12-08 20:30:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 20:30:55,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:55,569 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:55,569 INFO L423 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:55,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1455442659, now seen corresponding path program 1 times [2018-12-08 20:30:55,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:55,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:55,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:30:55,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:55,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-12-08 20:30:55,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:30:55,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:30:55,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:55,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:30:55,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:30:55,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:30:55,601 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 6 states. [2018-12-08 20:30:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:55,651 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-12-08 20:30:55,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:30:55,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-08 20:30:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:55,651 INFO L225 Difference]: With dead ends: 90 [2018-12-08 20:30:55,651 INFO L226 Difference]: Without dead ends: 90 [2018-12-08 20:30:55,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:30:55,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-08 20:30:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-08 20:30:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-08 20:30:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-12-08 20:30:55,653 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 87 [2018-12-08 20:30:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:55,653 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-12-08 20:30:55,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:30:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-12-08 20:30:55,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 20:30:55,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:55,653 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:55,653 INFO L423 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:55,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1455442660, now seen corresponding path program 1 times [2018-12-08 20:30:55,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:55,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:55,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:55,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:55,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-08 20:30:55,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:55,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:55,681 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2018-12-08 20:30:55,681 INFO L205 CegarAbsIntRunner]: [0], [1], [3], [9], [11], [12], [15], [18], [20], [24], [25], [27], [33], [35], [36], [39], [42], [44], [48], [49], [51], [57], [59], [60], [63], [66], [68], [72], [73], [78], [86], [89], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [123], [124], [125], [126], [128], [129] [2018-12-08 20:30:55,682 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:30:55,682 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:30:55,734 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:30:55,734 INFO L272 AbstractInterpreter]: Visited 50 different actions 125 times. Merged at 21 different actions 62 times. Widened at 1 different actions 1 times. Performed 869 root evaluator evaluations with a maximum evaluation depth of 4. Performed 869 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 9 different actions. Largest state had 39 variables. [2018-12-08 20:30:55,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:55,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:30:55,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:55,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:55,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:55,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:30:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:55,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-08 20:30:55,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-08 20:30:55,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:30:55,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-08 20:30:55,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:30:55,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:30:55,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:30:55,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:30:55,853 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 7 states. [2018-12-08 20:30:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:55,874 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-12-08 20:30:55,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:30:55,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-12-08 20:30:55,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:55,875 INFO L225 Difference]: With dead ends: 99 [2018-12-08 20:30:55,875 INFO L226 Difference]: Without dead ends: 99 [2018-12-08 20:30:55,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 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-12-08 20:30:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-08 20:30:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-12-08 20:30:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-08 20:30:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-12-08 20:30:55,878 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 87 [2018-12-08 20:30:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:55,878 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-12-08 20:30:55,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:30:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-12-08 20:30:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 20:30:55,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:30:55,878 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:30:55,879 INFO L423 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-12-08 20:30:55,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:30:55,879 INFO L82 PathProgramCache]: Analyzing trace with hash -383950776, now seen corresponding path program 2 times [2018-12-08 20:30:55,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:30:55,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:55,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:30:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:30:55,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:30:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:30:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-08 20:30:55,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:55,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:30:55,930 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 20:30:55,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 20:30:55,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:30:55,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/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-12-08 20:30:55,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 20:30:55,937 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 20:30:55,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 20:30:55,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:30:55,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:30:55,962 INFO L478 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 46 treesize of output 42 [2018-12-08 20:30:55,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:55,979 INFO L478 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 39 treesize of output 52 [2018-12-08 20:30:56,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,010 INFO L478 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 37 treesize of output 50 [2018-12-08 20:30:56,012 INFO L478 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 35 treesize of output 45 [2018-12-08 20:30:56,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 32 [2018-12-08 20:30:56,030 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,036 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,064 INFO L478 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 39 treesize of output 60 [2018-12-08 20:30:56,066 INFO L478 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 54 treesize of output 49 [2018-12-08 20:30:56,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 32 [2018-12-08 20:30:56,085 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,093 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,119 INFO L478 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 32 treesize of output 59 [2018-12-08 20:30:56,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 40 [2018-12-08 20:30:56,165 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,189 INFO L478 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 38 treesize of output 41 [2018-12-08 20:30:56,189 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,203 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,219 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 20:30:56,231 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-08 20:30:56,247 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 20:30:56,249 INFO L478 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 23 treesize of output 37 [2018-12-08 20:30:56,252 INFO L478 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 25 treesize of output 39 [2018-12-08 20:30:56,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:30:56,255 INFO L478 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 60 [2018-12-08 20:30:56,256 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,266 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,272 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,277 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,281 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:30:56,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 20:30:56,292 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2018-12-08 20:30:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-08 20:30:56,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:30:56,538 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-08 20:30:56,592 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-08 20:30:56,624 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-08 20:30:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-08 20:30:56,686 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:30:56,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2018-12-08 20:30:56,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:30:56,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:30:56,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:30:56,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-12-08 20:30:56,687 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 7 states. [2018-12-08 20:30:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:30:56,818 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-12-08 20:30:56,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:30:56,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-08 20:30:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:30:56,818 INFO L225 Difference]: With dead ends: 95 [2018-12-08 20:30:56,818 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 20:30:56,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-12-08 20:30:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 20:30:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 20:30:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 20:30:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 20:30:56,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2018-12-08 20:30:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:30:56,819 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:30:56,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:30:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 20:30:56,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 20:30:56,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:30:56 BoogieIcfgContainer [2018-12-08 20:30:56,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 20:30:56,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 20:30:56,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 20:30:56,823 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 20:30:56,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:30:39" (3/4) ... [2018-12-08 20:30:56,825 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 20:30:56,829 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 20:30:56,829 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2018-12-08 20:30:56,829 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2018-12-08 20:30:56,829 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2018-12-08 20:30:56,829 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 20:30:56,829 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2018-12-08 20:30:56,832 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2018-12-08 20:30:56,832 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-08 20:30:56,833 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-08 20:30:56,833 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-08 20:30:56,856 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_34be3860-a3d2-43d3-839c-7b1d29d777d2/bin-2019/utaipan/witness.graphml [2018-12-08 20:30:56,856 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 20:30:56,856 INFO L168 Benchmark]: Toolchain (without parser) took 17755.24 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 521.1 MB). Free memory was 957.7 MB in the beginning and 954.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 524.3 MB. Max. memory is 11.5 GB. [2018-12-08 20:30:56,856 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:30:56,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.68 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:30:56,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.05 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 941.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 20:30:56,857 INFO L168 Benchmark]: Boogie Preprocessor took 49.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-08 20:30:56,857 INFO L168 Benchmark]: RCFGBuilder took 229.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-12-08 20:30:56,857 INFO L168 Benchmark]: TraceAbstraction took 17273.80 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 400.6 MB). Free memory was 1.1 GB in the beginning and 954.6 MB in the end (delta: 131.5 MB). Peak memory consumption was 532.1 MB. Max. memory is 11.5 GB. [2018-12-08 20:30:56,857 INFO L168 Benchmark]: Witness Printer took 33.14 ms. Allocated memory is still 1.6 GB. Free memory was 954.6 MB in the beginning and 954.6 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-08 20:30:56,858 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.68 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 947.0 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 16.05 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 941.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 229.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17273.80 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 400.6 MB). Free memory was 1.1 GB in the beginning and 954.6 MB in the end (delta: 131.5 MB). Peak memory consumption was 532.1 MB. Max. memory is 11.5 GB. * Witness Printer took 33.14 ms. Allocated memory is still 1.6 GB. Free memory was 954.6 MB in the beginning and 954.6 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: 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: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: 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, 70 locations, 17 error locations. SAFE Result, 17.2s OverallTime, 27 OverallIterations, 10 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1326 SDtfs, 908 SDslu, 3287 SDs, 0 SdLazy, 1340 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2399 GetRequests, 2092 SyntacticMatches, 36 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 11 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 25 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 2456 NumberOfCodeBlocks, 2129 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3492 ConstructedInterpolants, 611 QuantifiedInterpolants, 2794584 SizeOfPredicates, 81 NumberOfNonLiveVariables, 5680 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 69 InterpolantComputations, 26 PerfectInterpolantSequences, 4338/6066 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...