./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 440325a953e10d2173456ab8f8c8fc1313a6b958 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:29:16,084 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:29:16,086 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:29:16,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:29:16,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:29:16,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:29:16,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:29:16,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:29:16,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:29:16,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:29:16,098 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:29:16,098 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:29:16,099 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:29:16,099 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:29:16,100 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:29:16,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:29:16,101 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:29:16,102 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:29:16,104 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:29:16,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:29:16,105 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:29:16,106 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:29:16,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:29:16,108 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:29:16,108 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:29:16,109 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:29:16,109 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:29:16,110 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:29:16,111 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:29:16,111 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:29:16,111 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:29:16,112 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:29:16,112 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:29:16,112 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:29:16,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:29:16,113 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:29:16,114 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-18 09:29:16,122 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:29:16,122 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:29:16,123 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:29:16,123 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:29:16,123 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:29:16,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:29:16,123 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:29:16,124 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:29:16,124 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:29:16,124 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:29:16,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:29:16,124 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 09:29:16,124 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 09:29:16,125 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-18 09:29:16,125 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:29:16,125 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:29:16,125 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:29:16,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:29:16,125 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:29:16,125 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:29:16,126 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:29:16,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:29:16,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:29:16,126 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:29:16,126 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:29:16,126 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:29:16,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 440325a953e10d2173456ab8f8c8fc1313a6b958 [2018-11-18 09:29:16,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:29:16,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:29:16,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:29:16,160 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:29:16,160 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:29:16,161 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2018-11-18 09:29:16,194 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/data/08dd80152/67e11a5aff3443b7bc1a559dc4cff3a8/FLAGe2cc1a1b8 [2018-11-18 09:29:16,586 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:29:16,587 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2018-11-18 09:29:16,591 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/data/08dd80152/67e11a5aff3443b7bc1a559dc4cff3a8/FLAGe2cc1a1b8 [2018-11-18 09:29:16,602 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/data/08dd80152/67e11a5aff3443b7bc1a559dc4cff3a8 [2018-11-18 09:29:16,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:29:16,605 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 09:29:16,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:29:16,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:29:16,607 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:29:16,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:29:16" (1/1) ... [2018-11-18 09:29:16,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f427c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:29:16, skipping insertion in model container [2018-11-18 09:29:16,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:29:16" (1/1) ... [2018-11-18 09:29:16,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:29:16,627 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:29:16,728 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:29:16,737 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:29:16,752 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:29:16,762 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:29:16,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:29:16 WrapperNode [2018-11-18 09:29:16,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:29:16,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:29:16,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:29:16,763 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:29:16,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:29:16" (1/1) ... [2018-11-18 09:29:16,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:29:16" (1/1) ... [2018-11-18 09:29:16,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:29:16" (1/1) ... [2018-11-18 09:29:16,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:29:16" (1/1) ... [2018-11-18 09:29:16,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:29:16" (1/1) ... [2018-11-18 09:29:16,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:29:16" (1/1) ... [2018-11-18 09:29:16,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:29:16" (1/1) ... [2018-11-18 09:29:16,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:29:16,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:29:16,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:29:16,788 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:29:16,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:29:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:29:16,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:29:16,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:29:16,861 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-18 09:29:16,862 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-11-18 09:29:16,862 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-11-18 09:29:16,862 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-11-18 09:29:16,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:29:16,862 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-11-18 09:29:16,862 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-18 09:29:16,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 09:29:16,862 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-11-18 09:29:16,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:29:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-11-18 09:29:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:29:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:29:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-11-18 09:29:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:29:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:29:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:29:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 09:29:17,138 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:29:17,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:29:17 BoogieIcfgContainer [2018-11-18 09:29:17,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:29:17,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:29:17,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:29:17,141 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:29:17,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:29:16" (1/3) ... [2018-11-18 09:29:17,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30df68c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:29:17, skipping insertion in model container [2018-11-18 09:29:17,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:29:16" (2/3) ... [2018-11-18 09:29:17,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30df68c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:29:17, skipping insertion in model container [2018-11-18 09:29:17,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:29:17" (3/3) ... [2018-11-18 09:29:17,144 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_false-valid-deref.c [2018-11-18 09:29:17,152 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:29:17,159 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-18 09:29:17,172 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-18 09:29:17,194 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:29:17,194 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:29:17,194 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 09:29:17,194 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:29:17,195 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:29:17,195 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:29:17,195 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:29:17,195 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:29:17,195 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:29:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2018-11-18 09:29:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 09:29:17,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:17,215 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:17,217 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:17,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash -520194102, now seen corresponding path program 1 times [2018-11-18 09:29:17,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:17,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:17,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:17,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:17,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:17,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:29:17,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:29:17,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:29:17,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:29:17,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:29:17,401 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2018-11-18 09:29:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:17,470 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-11-18 09:29:17,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:29:17,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-18 09:29:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:17,480 INFO L225 Difference]: With dead ends: 74 [2018-11-18 09:29:17,480 INFO L226 Difference]: Without dead ends: 71 [2018-11-18 09:29:17,481 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:29:17,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-18 09:29:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-18 09:29:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 09:29:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-18 09:29:17,515 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 13 [2018-11-18 09:29:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:17,515 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-18 09:29:17,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:29:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-18 09:29:17,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 09:29:17,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:17,516 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:17,516 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:17,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:17,517 INFO L82 PathProgramCache]: Analyzing trace with hash -520194101, now seen corresponding path program 1 times [2018-11-18 09:29:17,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:17,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:17,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:17,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:17,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:17,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:29:17,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:29:17,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:29:17,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:29:17,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:29:17,616 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 4 states. [2018-11-18 09:29:17,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:17,687 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-11-18 09:29:17,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:29:17,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-18 09:29:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:17,688 INFO L225 Difference]: With dead ends: 75 [2018-11-18 09:29:17,688 INFO L226 Difference]: Without dead ends: 75 [2018-11-18 09:29:17,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:29:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-18 09:29:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-18 09:29:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 09:29:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-11-18 09:29:17,696 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 13 [2018-11-18 09:29:17,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:17,696 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-18 09:29:17,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:29:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-18 09:29:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 09:29:17,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:17,697 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:17,697 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:17,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:17,697 INFO L82 PathProgramCache]: Analyzing trace with hash -902677918, now seen corresponding path program 1 times [2018-11-18 09:29:17,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:17,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:17,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:17,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:17,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:17,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:17,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:17,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:17,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:17,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 09:29:17,939 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:17,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 09:29:17,947 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:17,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:17,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:17,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:17,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 42 [2018-11-18 09:29:17,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:17,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:17,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:17,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-11-18 09:29:17,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:17,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,010 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 09:29:18,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,020 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-11-18 09:29:18,021 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,043 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:29:18,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:29:18,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-18 09:29:18,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 34 [2018-11-18 09:29:18,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,137 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2018-11-18 09:29:18,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,208 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-18 09:29:18,210 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-18 09:29:18,237 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,250 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,266 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-11-18 09:29:18,287 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,290 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-18 09:29:18,292 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,303 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,310 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,314 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-18 09:29:18,331 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:50, output treesize:68 [2018-11-18 09:29:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:18,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:18,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-11-18 09:29:18,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 09:29:18,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 09:29:18,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:29:18,444 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 8 states. [2018-11-18 09:29:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:18,552 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-11-18 09:29:18,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:29:18,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-18 09:29:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:18,553 INFO L225 Difference]: With dead ends: 79 [2018-11-18 09:29:18,553 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 09:29:18,553 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:29:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 09:29:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-11-18 09:29:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 09:29:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-11-18 09:29:18,559 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 17 [2018-11-18 09:29:18,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:18,559 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-11-18 09:29:18,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 09:29:18,559 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-18 09:29:18,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 09:29:18,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:18,560 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:18,560 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:18,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1744512647, now seen corresponding path program 2 times [2018-11-18 09:29:18,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:18,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:18,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:18,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:18,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:18,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:29:18,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:29:18,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:18,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:18,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 09:29:18,721 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 09:29:18,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 09:29:18,732 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-11-18 09:29:18,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,763 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 42 [2018-11-18 09:29:18,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-11-18 09:29:18,774 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,786 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,801 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:29:18,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:29:18,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-18 09:29:18,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 34 [2018-11-18 09:29:18,862 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,864 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 41 [2018-11-18 09:29:18,881 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,883 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,884 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-11-18 09:29:18,888 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,895 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,909 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,909 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2018-11-18 09:29:18,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,965 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,968 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-18 09:29:18,970 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:18,989 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,989 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:18,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-18 09:29:18,993 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:19,003 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:19,012 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:19,016 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:19,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-18 09:29:19,030 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:50, output treesize:68 [2018-11-18 09:29:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:19,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:29:19,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2018-11-18 09:29:19,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 09:29:19,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:29:19,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:29:19,169 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 12 states. [2018-11-18 09:29:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:19,373 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-18 09:29:19,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 09:29:19,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-18 09:29:19,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:19,374 INFO L225 Difference]: With dead ends: 84 [2018-11-18 09:29:19,374 INFO L226 Difference]: Without dead ends: 84 [2018-11-18 09:29:19,375 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-11-18 09:29:19,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-18 09:29:19,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-18 09:29:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 09:29:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-11-18 09:29:19,378 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 21 [2018-11-18 09:29:19,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:19,379 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-11-18 09:29:19,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 09:29:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-18 09:29:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 09:29:19,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:19,380 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:19,380 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:19,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:19,380 INFO L82 PathProgramCache]: Analyzing trace with hash 504949789, now seen corresponding path program 1 times [2018-11-18 09:29:19,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:19,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:19,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:19,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:19,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 09:29:19,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:29:19,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:29:19,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:29:19,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:29:19,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:29:19,435 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 6 states. [2018-11-18 09:29:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:19,486 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-18 09:29:19,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:29:19,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-11-18 09:29:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:19,487 INFO L225 Difference]: With dead ends: 83 [2018-11-18 09:29:19,487 INFO L226 Difference]: Without dead ends: 83 [2018-11-18 09:29:19,488 INFO L604 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-11-18 09:29:19,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-18 09:29:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-18 09:29:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 09:29:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-18 09:29:19,492 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 35 [2018-11-18 09:29:19,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:19,492 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-18 09:29:19,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:29:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-18 09:29:19,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 09:29:19,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:19,493 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:19,493 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:19,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:19,493 INFO L82 PathProgramCache]: Analyzing trace with hash 504949790, now seen corresponding path program 1 times [2018-11-18 09:29:19,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:19,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:19,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:19,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:19,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:19,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:19,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:19,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:19,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:19,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:19,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 09:29:19,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 09:29:19,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 09:29:19,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:29:19,610 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 8 states. [2018-11-18 09:29:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:19,625 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-11-18 09:29:19,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:29:19,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-18 09:29:19,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:19,626 INFO L225 Difference]: With dead ends: 89 [2018-11-18 09:29:19,626 INFO L226 Difference]: Without dead ends: 89 [2018-11-18 09:29:19,626 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:29:19,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-18 09:29:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-11-18 09:29:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-18 09:29:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-18 09:29:19,629 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 35 [2018-11-18 09:29:19,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:19,629 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-18 09:29:19,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 09:29:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-18 09:29:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 09:29:19,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:19,629 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:19,629 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:19,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:19,630 INFO L82 PathProgramCache]: Analyzing trace with hash 678466421, now seen corresponding path program 2 times [2018-11-18 09:29:19,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:19,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:19,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:19,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:19,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:19,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:19,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:19,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:29:19,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 09:29:19,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:19,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:19,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-18 09:29:19,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 34 [2018-11-18 09:29:19,807 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,808 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,811 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2018-11-18 09:29:19,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,861 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,862 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,863 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,863 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-11-18 09:29:19,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:19,885 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-18 09:29:19,894 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:19,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:19,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,923 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-11-18 09:29:19,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,982 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:19,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-18 09:29:19,992 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:20,000 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:20,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:20,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:20,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 09:29:20,025 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 09:29:20,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 09:29:20,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-11-18 09:29:20,033 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:20,039 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:20,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 42 [2018-11-18 09:29:20,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-11-18 09:29:20,051 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:20,060 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:20,069 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:29:20,077 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:29:20,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-18 09:29:20,093 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:50, output treesize:68 [2018-11-18 09:29:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-18 09:29:20,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:29:20,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2018-11-18 09:29:20,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 09:29:20,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 09:29:20,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-18 09:29:20,240 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 13 states. [2018-11-18 09:29:20,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:20,519 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-11-18 09:29:20,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 09:29:20,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-11-18 09:29:20,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:20,520 INFO L225 Difference]: With dead ends: 94 [2018-11-18 09:29:20,520 INFO L226 Difference]: Without dead ends: 94 [2018-11-18 09:29:20,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-11-18 09:29:20,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-18 09:29:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-11-18 09:29:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 09:29:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-18 09:29:20,524 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 39 [2018-11-18 09:29:20,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:20,525 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-18 09:29:20,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 09:29:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-18 09:29:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 09:29:20,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:20,526 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:20,526 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:20,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:20,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1198535248, now seen corresponding path program 1 times [2018-11-18 09:29:20,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:20,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:20,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:20,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:20,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:20,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:20,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:20,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:20,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:20,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:20,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 09:29:20,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 09:29:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:29:20,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:29:20,668 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 10 states. [2018-11-18 09:29:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:20,696 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-11-18 09:29:20,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 09:29:20,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-18 09:29:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:20,697 INFO L225 Difference]: With dead ends: 98 [2018-11-18 09:29:20,697 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 09:29:20,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:29:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 09:29:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-18 09:29:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-18 09:29:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-11-18 09:29:20,702 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 44 [2018-11-18 09:29:20,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:20,702 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-11-18 09:29:20,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 09:29:20,702 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-18 09:29:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 09:29:20,703 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:20,703 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:20,703 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:20,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:20,704 INFO L82 PathProgramCache]: Analyzing trace with hash -591799079, now seen corresponding path program 2 times [2018-11-18 09:29:20,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:20,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:20,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:20,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:20,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:20,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:20,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:20,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:29:20,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 09:29:20,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:20,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:20,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-18 09:29:20,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 38 [2018-11-18 09:29:20,814 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,818 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2018-11-18 09:29:20,885 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 62 [2018-11-18 09:29:20,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2018-11-18 09:29:20,912 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:20,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:20,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 60 [2018-11-18 09:29:20,969 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 09:29:21,037 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 09:29:21,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:21,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:21,077 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:21,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 56 [2018-11-18 09:29:21,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-11-18 09:29:21,081 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:21,091 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:21,126 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 09:29:21,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-18 09:29:21,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:21,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:21,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:21,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 45 [2018-11-18 09:29:21,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-11-18 09:29:21,190 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:21,199 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:21,206 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:21,252 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 09:29:21,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 09:29:21,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-11-18 09:29:21,330 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:36, output treesize:174 [2018-11-18 09:29:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-18 09:29:21,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:29:21,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2018-11-18 09:29:21,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 09:29:21,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 09:29:21,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:29:21,505 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 11 states. [2018-11-18 09:29:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:21,816 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-18 09:29:21,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:29:21,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-11-18 09:29:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:21,817 INFO L225 Difference]: With dead ends: 101 [2018-11-18 09:29:21,818 INFO L226 Difference]: Without dead ends: 101 [2018-11-18 09:29:21,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-11-18 09:29:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-18 09:29:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-18 09:29:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 09:29:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-11-18 09:29:21,821 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 48 [2018-11-18 09:29:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:21,822 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-11-18 09:29:21,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 09:29:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-18 09:29:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 09:29:21,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:21,827 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:21,827 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:21,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash 145300195, now seen corresponding path program 1 times [2018-11-18 09:29:21,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:21,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:21,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:21,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:21,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:21,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:21,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:21,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:21,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:21,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:21,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 09:29:21,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 09:29:21,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:29:21,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:29:21,959 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 12 states. [2018-11-18 09:29:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:21,989 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-18 09:29:21,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:29:21,995 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-11-18 09:29:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:21,996 INFO L225 Difference]: With dead ends: 105 [2018-11-18 09:29:21,996 INFO L226 Difference]: Without dead ends: 105 [2018-11-18 09:29:21,996 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:29:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-18 09:29:21,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-18 09:29:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 09:29:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-18 09:29:22,000 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 52 [2018-11-18 09:29:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:22,000 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-18 09:29:22,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 09:29:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-18 09:29:22,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 09:29:22,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:22,001 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:22,001 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:22,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:22,002 INFO L82 PathProgramCache]: Analyzing trace with hash 256388204, now seen corresponding path program 2 times [2018-11-18 09:29:22,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:22,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:22,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:22,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:22,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:29:22,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:22,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:22,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:29:22,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 09:29:22,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:22,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:22,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 09:29:22,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 09:29:22,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 09:29:22,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,110 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-11-18 09:29:22,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,119 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 42 [2018-11-18 09:29:22,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-11-18 09:29:22,135 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,144 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,154 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:29:22,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:29:22,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-18 09:29:22,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 34 [2018-11-18 09:29:22,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 41 [2018-11-18 09:29:22,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-11-18 09:29:22,215 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,221 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2018-11-18 09:29:22,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,272 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,273 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,275 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-18 09:29:22,277 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-18 09:29:22,295 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,304 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,310 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,313 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-18 09:29:22,331 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:50, output treesize:68 [2018-11-18 09:29:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-18 09:29:22,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:29:22,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2018-11-18 09:29:22,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 09:29:22,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 09:29:22,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-18 09:29:22,452 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 15 states. [2018-11-18 09:29:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:22,690 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-18 09:29:22,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 09:29:22,691 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-11-18 09:29:22,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:22,692 INFO L225 Difference]: With dead ends: 106 [2018-11-18 09:29:22,692 INFO L226 Difference]: Without dead ends: 106 [2018-11-18 09:29:22,692 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=205, Invalid=395, Unknown=0, NotChecked=0, Total=600 [2018-11-18 09:29:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-18 09:29:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-18 09:29:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-18 09:29:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2018-11-18 09:29:22,695 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 56 [2018-11-18 09:29:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:22,695 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2018-11-18 09:29:22,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 09:29:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-18 09:29:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 09:29:22,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:22,700 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:22,700 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:22,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:22,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1656853965, now seen corresponding path program 1 times [2018-11-18 09:29:22,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:22,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:22,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:22,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 09:29:22,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:22,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:22,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:22,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 09:29:22,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:22,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 09:29:22,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:29:22,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:29:22,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:29:22,803 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 5 states. [2018-11-18 09:29:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:22,811 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-11-18 09:29:22,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:29:22,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-18 09:29:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:22,813 INFO L225 Difference]: With dead ends: 116 [2018-11-18 09:29:22,813 INFO L226 Difference]: Without dead ends: 116 [2018-11-18 09:29:22,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:29:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-18 09:29:22,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-11-18 09:29:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-18 09:29:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-11-18 09:29:22,816 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 71 [2018-11-18 09:29:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:22,816 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-11-18 09:29:22,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:29:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-11-18 09:29:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 09:29:22,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:22,817 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 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] [2018-11-18 09:29:22,818 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:22,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:22,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1007465411, now seen corresponding path program 2 times [2018-11-18 09:29:22,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:22,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:22,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:22,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:22,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 09:29:22,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:22,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:22,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:29:22,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 09:29:22,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:22,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:22,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-11-18 09:29:22,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 46 [2018-11-18 09:29:22,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-11-18 09:29:22,937 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,938 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,938 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 58 [2018-11-18 09:29:22,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2018-11-18 09:29:22,945 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,955 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:22,982 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,983 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:22,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 60 [2018-11-18 09:29:23,040 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,042 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,044 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 66 [2018-11-18 09:29:23,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 54 [2018-11-18 09:29:23,047 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:23,058 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:23,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,081 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,082 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 72 [2018-11-18 09:29:23,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2018-11-18 09:29:23,093 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:23,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 68 [2018-11-18 09:29:23,140 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-18 09:29:23,190 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 09:29:23,234 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 09:29:23,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 09:29:23,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 09:29:23,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-11-18 09:29:23,387 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:50, output treesize:214 [2018-11-18 09:29:23,640 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,641 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,643 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,644 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,646 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:23,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 75 [2018-11-18 09:29:23,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-18 09:29:23,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-11-18 09:29:23,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:23,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-11-18 09:29:23,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:156 [2018-11-18 09:29:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-18 09:29:23,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:29:23,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-11-18 09:29:23,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 09:29:23,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:29:23,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:29:23,889 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 9 states. [2018-11-18 09:29:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:24,118 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-18 09:29:24,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 09:29:24,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2018-11-18 09:29:24,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:24,119 INFO L225 Difference]: With dead ends: 121 [2018-11-18 09:29:24,119 INFO L226 Difference]: Without dead ends: 121 [2018-11-18 09:29:24,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:29:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-18 09:29:24,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-11-18 09:29:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-18 09:29:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-11-18 09:29:24,122 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 77 [2018-11-18 09:29:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:24,123 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-11-18 09:29:24,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 09:29:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-18 09:29:24,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 09:29:24,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:24,124 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 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] [2018-11-18 09:29:24,125 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:24,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:24,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1693777606, now seen corresponding path program 1 times [2018-11-18 09:29:24,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:24,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:24,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:24,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:24,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 09:29:24,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:24,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:24,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:24,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 09:29:24,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:24,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 09:29:24,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:29:24,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:29:24,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:29:24,230 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 7 states. [2018-11-18 09:29:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:24,245 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-11-18 09:29:24,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:29:24,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-11-18 09:29:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:24,247 INFO L225 Difference]: With dead ends: 127 [2018-11-18 09:29:24,247 INFO L226 Difference]: Without dead ends: 127 [2018-11-18 09:29:24,247 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:29:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-18 09:29:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-11-18 09:29:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 09:29:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-11-18 09:29:24,250 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 83 [2018-11-18 09:29:24,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:24,250 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-11-18 09:29:24,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:29:24,250 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-18 09:29:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 09:29:24,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:24,251 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 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] [2018-11-18 09:29:24,251 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:24,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:24,252 INFO L82 PathProgramCache]: Analyzing trace with hash -444932560, now seen corresponding path program 2 times [2018-11-18 09:29:24,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:24,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:24,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:24,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:24,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 09:29:24,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:24,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:24,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:29:24,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 09:29:24,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:24,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:24,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-11-18 09:29:24,367 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 46 [2018-11-18 09:29:24,404 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,410 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 60 [2018-11-18 09:29:24,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,464 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 66 [2018-11-18 09:29:24,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 54 [2018-11-18 09:29:24,469 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:24,484 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:24,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,511 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,512 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,515 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,517 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 72 [2018-11-18 09:29:24,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2018-11-18 09:29:24,525 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:24,560 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,561 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,562 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,564 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,566 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,567 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 68 [2018-11-18 09:29:24,572 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-18 09:29:24,619 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 09:29:24,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 09:29:24,732 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-11-18 09:29:24,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,754 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 58 [2018-11-18 09:29:24,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2018-11-18 09:29:24,762 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:24,772 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:24,782 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:24,842 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 09:29:24,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 09:29:24,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 09:29:24,988 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 09:29:24,994 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,996 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:24,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 42 [2018-11-18 09:29:24,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-11-18 09:29:25,001 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:25,013 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:25,025 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-18 09:29:25,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,036 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-11-18 09:29:25,036 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:25,044 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:25,053 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:29:25,068 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:29:25,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 10 xjuncts. [2018-11-18 09:29:25,132 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 5 variables, input treesize:68, output treesize:527 [2018-11-18 09:29:25,726 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 332 DAG size of output: 91 [2018-11-18 09:29:25,732 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,734 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 71 [2018-11-18 09:29:25,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:25,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,820 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,820 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,822 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,826 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 105 [2018-11-18 09:29:25,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:25,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,921 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,921 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 72 [2018-11-18 09:29:25,923 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:25,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:25,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 78 [2018-11-18 09:29:25,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:26,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-11-18 09:29:26,062 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:26,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,126 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,126 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,127 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-11-18 09:29:26,128 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:26,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,188 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,188 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:29:26,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-11-18 09:29:26,189 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:26,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-11-18 09:29:26,247 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:26,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 8 dim-1 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2018-11-18 09:29:26,300 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 19 variables, input treesize:259, output treesize:225 [2018-11-18 09:29:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-11-18 09:29:26,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:29:26,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2018-11-18 09:29:26,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 09:29:26,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:29:26,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:29:26,529 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 12 states. [2018-11-18 09:29:27,013 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2018-11-18 09:29:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:27,235 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2018-11-18 09:29:27,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 09:29:27,235 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2018-11-18 09:29:27,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:27,235 INFO L225 Difference]: With dead ends: 134 [2018-11-18 09:29:27,235 INFO L226 Difference]: Without dead ends: 134 [2018-11-18 09:29:27,236 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-11-18 09:29:27,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-18 09:29:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2018-11-18 09:29:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 09:29:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2018-11-18 09:29:27,237 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 89 [2018-11-18 09:29:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:27,238 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2018-11-18 09:29:27,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 09:29:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-11-18 09:29:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 09:29:27,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:27,239 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:27,239 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:27,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:27,239 INFO L82 PathProgramCache]: Analyzing trace with hash 159558173, now seen corresponding path program 1 times [2018-11-18 09:29:27,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:27,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:27,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:27,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:27,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-18 09:29:27,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:29:27,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:29:27,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:29:27,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:29:27,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:29:27,272 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand 3 states. [2018-11-18 09:29:27,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:27,295 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-11-18 09:29:27,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:29:27,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-11-18 09:29:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:27,296 INFO L225 Difference]: With dead ends: 129 [2018-11-18 09:29:27,296 INFO L226 Difference]: Without dead ends: 129 [2018-11-18 09:29:27,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:29:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-18 09:29:27,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-11-18 09:29:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-18 09:29:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2018-11-18 09:29:27,298 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 96 [2018-11-18 09:29:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:27,299 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2018-11-18 09:29:27,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:29:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-11-18 09:29:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 09:29:27,300 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:27,300 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:27,300 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:27,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:27,300 INFO L82 PathProgramCache]: Analyzing trace with hash 159558174, now seen corresponding path program 1 times [2018-11-18 09:29:27,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:27,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:27,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:27,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:27,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 09:29:27,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:27,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:27,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:27,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 09:29:27,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:27,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 09:29:27,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 09:29:27,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:29:27,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:29:27,446 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 9 states. [2018-11-18 09:29:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:27,468 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-11-18 09:29:27,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 09:29:27,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-11-18 09:29:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:27,469 INFO L225 Difference]: With dead ends: 139 [2018-11-18 09:29:27,469 INFO L226 Difference]: Without dead ends: 139 [2018-11-18 09:29:27,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:29:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-18 09:29:27,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-11-18 09:29:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 09:29:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-11-18 09:29:27,472 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 96 [2018-11-18 09:29:27,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:27,472 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-11-18 09:29:27,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 09:29:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-18 09:29:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 09:29:27,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:27,473 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:27,473 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:27,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:27,473 INFO L82 PathProgramCache]: Analyzing trace with hash 265817320, now seen corresponding path program 2 times [2018-11-18 09:29:27,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:27,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:27,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 09:29:27,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:27,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:27,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:29:27,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 09:29:27,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:27,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:27,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 09:29:27,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 09:29:27,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:29:27,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-18 09:29:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-11-18 09:29:27,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:29:27,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-11-18 09:29:27,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 09:29:27,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 09:29:27,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:29:27,630 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 11 states. [2018-11-18 09:29:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:27,686 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2018-11-18 09:29:27,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:29:27,687 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2018-11-18 09:29:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:27,688 INFO L225 Difference]: With dead ends: 144 [2018-11-18 09:29:27,688 INFO L226 Difference]: Without dead ends: 144 [2018-11-18 09:29:27,688 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:29:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-18 09:29:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-11-18 09:29:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 09:29:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-11-18 09:29:27,691 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 102 [2018-11-18 09:29:27,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:27,691 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-11-18 09:29:27,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 09:29:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-11-18 09:29:27,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 09:29:27,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:27,692 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 8, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:27,692 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:27,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:27,692 INFO L82 PathProgramCache]: Analyzing trace with hash -426112564, now seen corresponding path program 1 times [2018-11-18 09:29:27,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:27,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:27,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:27,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:27,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-18 09:29:27,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:27,743 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:27,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:27,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-18 09:29:27,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:27,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 09:29:27,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 09:29:27,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 09:29:27,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:29:27,812 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 11 states. [2018-11-18 09:29:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:27,858 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-11-18 09:29:27,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:29:27,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 119 [2018-11-18 09:29:27,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:27,859 INFO L225 Difference]: With dead ends: 150 [2018-11-18 09:29:27,859 INFO L226 Difference]: Without dead ends: 150 [2018-11-18 09:29:27,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:29:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-18 09:29:27,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2018-11-18 09:29:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 09:29:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2018-11-18 09:29:27,862 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 119 [2018-11-18 09:29:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:27,863 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2018-11-18 09:29:27,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 09:29:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-18 09:29:27,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 09:29:27,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:27,863 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:27,863 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:27,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:27,863 INFO L82 PathProgramCache]: Analyzing trace with hash 43066306, now seen corresponding path program 2 times [2018-11-18 09:29:27,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:27,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:27,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:27,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:27,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-18 09:29:27,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:27,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:27,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:29:27,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:29:27,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:27,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-18 09:29:28,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:28,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 09:29:28,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 09:29:28,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:29:28,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:29:28,018 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand 12 states. [2018-11-18 09:29:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:28,052 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-11-18 09:29:28,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:29:28,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2018-11-18 09:29:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:28,059 INFO L225 Difference]: With dead ends: 156 [2018-11-18 09:29:28,059 INFO L226 Difference]: Without dead ends: 156 [2018-11-18 09:29:28,059 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:29:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-18 09:29:28,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2018-11-18 09:29:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-18 09:29:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2018-11-18 09:29:28,062 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 125 [2018-11-18 09:29:28,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:28,062 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-11-18 09:29:28,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 09:29:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2018-11-18 09:29:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 09:29:28,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:28,063 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:28,063 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:28,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:28,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1515089208, now seen corresponding path program 3 times [2018-11-18 09:29:28,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:28,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:28,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:28,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:28,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-18 09:29:28,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:28,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:28,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 09:29:28,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 09:29:28,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:28,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2018-11-18 09:29:28,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:28,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2018-11-18 09:29:28,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 09:29:28,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 09:29:28,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:29:28,232 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 14 states. [2018-11-18 09:29:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:28,286 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2018-11-18 09:29:28,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 09:29:28,287 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 131 [2018-11-18 09:29:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:28,287 INFO L225 Difference]: With dead ends: 168 [2018-11-18 09:29:28,287 INFO L226 Difference]: Without dead ends: 168 [2018-11-18 09:29:28,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:29:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-18 09:29:28,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-11-18 09:29:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-18 09:29:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2018-11-18 09:29:28,291 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 131 [2018-11-18 09:29:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:28,291 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2018-11-18 09:29:28,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 09:29:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2018-11-18 09:29:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-18 09:29:28,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:28,292 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:28,292 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:28,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash 128727492, now seen corresponding path program 4 times [2018-11-18 09:29:28,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:28,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:28,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:28,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:28,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:28,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:28,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:28,339 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 09:29:28,956 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 09:29:28,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:28,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:29,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:29,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 09:29:29,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:29:29,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:29:29,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:29:29,014 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand 6 states. [2018-11-18 09:29:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:29,040 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2018-11-18 09:29:29,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:29:29,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2018-11-18 09:29:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:29,043 INFO L225 Difference]: With dead ends: 174 [2018-11-18 09:29:29,043 INFO L226 Difference]: Without dead ends: 174 [2018-11-18 09:29:29,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:29:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-18 09:29:29,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2018-11-18 09:29:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-18 09:29:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 174 transitions. [2018-11-18 09:29:29,046 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 174 transitions. Word has length 143 [2018-11-18 09:29:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:29,046 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 174 transitions. [2018-11-18 09:29:29,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:29:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 174 transitions. [2018-11-18 09:29:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-18 09:29:29,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:29,047 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:29,047 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:29,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:29,047 INFO L82 PathProgramCache]: Analyzing trace with hash -286481190, now seen corresponding path program 5 times [2018-11-18 09:29:29,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:29,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:29,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:29,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:29,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:29,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:29,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:29,119 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 09:29:32,579 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-18 09:29:32,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:32,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:32,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:32,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 09:29:32,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:29:32,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:29:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:29:32,613 INFO L87 Difference]: Start difference. First operand 170 states and 174 transitions. Second operand 7 states. [2018-11-18 09:29:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:32,628 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2018-11-18 09:29:32,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:29:32,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2018-11-18 09:29:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:32,629 INFO L225 Difference]: With dead ends: 180 [2018-11-18 09:29:32,629 INFO L226 Difference]: Without dead ends: 180 [2018-11-18 09:29:32,629 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:29:32,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-18 09:29:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-11-18 09:29:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 09:29:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 180 transitions. [2018-11-18 09:29:32,632 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 180 transitions. Word has length 149 [2018-11-18 09:29:32,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:32,633 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 180 transitions. [2018-11-18 09:29:32,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:29:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 180 transitions. [2018-11-18 09:29:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 09:29:32,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:32,634 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:32,634 INFO L423 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:32,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash 750380912, now seen corresponding path program 6 times [2018-11-18 09:29:32,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:32,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:32,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:32,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:32,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:32,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:32,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:32,724 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 09:29:33,639 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-18 09:29:33,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:33,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:33,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:33,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 09:29:33,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 09:29:33,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 09:29:33,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:29:33,674 INFO L87 Difference]: Start difference. First operand 176 states and 180 transitions. Second operand 8 states. [2018-11-18 09:29:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:33,703 INFO L93 Difference]: Finished difference Result 186 states and 190 transitions. [2018-11-18 09:29:33,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:29:33,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 155 [2018-11-18 09:29:33,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:33,704 INFO L225 Difference]: With dead ends: 186 [2018-11-18 09:29:33,705 INFO L226 Difference]: Without dead ends: 186 [2018-11-18 09:29:33,705 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:29:33,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-18 09:29:33,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2018-11-18 09:29:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-18 09:29:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 186 transitions. [2018-11-18 09:29:33,708 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 186 transitions. Word has length 155 [2018-11-18 09:29:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:33,708 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 186 transitions. [2018-11-18 09:29:33,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 09:29:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 186 transitions. [2018-11-18 09:29:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-18 09:29:33,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:33,710 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:33,710 INFO L423 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:33,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:33,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1995727238, now seen corresponding path program 7 times [2018-11-18 09:29:33,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:33,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:33,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:33,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:33,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:33,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:33,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:33,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:33,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:33,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:33,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 09:29:33,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 09:29:33,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:29:33,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:29:33,846 INFO L87 Difference]: Start difference. First operand 182 states and 186 transitions. Second operand 9 states. [2018-11-18 09:29:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:33,874 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2018-11-18 09:29:33,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 09:29:33,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2018-11-18 09:29:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:33,876 INFO L225 Difference]: With dead ends: 192 [2018-11-18 09:29:33,876 INFO L226 Difference]: Without dead ends: 192 [2018-11-18 09:29:33,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:29:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-18 09:29:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2018-11-18 09:29:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-18 09:29:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 192 transitions. [2018-11-18 09:29:33,879 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 192 transitions. Word has length 161 [2018-11-18 09:29:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:33,879 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 192 transitions. [2018-11-18 09:29:33,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 09:29:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 192 transitions. [2018-11-18 09:29:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-18 09:29:33,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:33,880 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:33,881 INFO L423 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:33,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:33,881 INFO L82 PathProgramCache]: Analyzing trace with hash -239832292, now seen corresponding path program 8 times [2018-11-18 09:29:33,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:33,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:33,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:33,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:29:33,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:33,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:33,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:33,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:29:33,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:29:33,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:33,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:34,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:34,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 09:29:34,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 09:29:34,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:29:34,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:29:34,032 INFO L87 Difference]: Start difference. First operand 188 states and 192 transitions. Second operand 10 states. [2018-11-18 09:29:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:34,060 INFO L93 Difference]: Finished difference Result 198 states and 202 transitions. [2018-11-18 09:29:34,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 09:29:34,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 167 [2018-11-18 09:29:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:34,063 INFO L225 Difference]: With dead ends: 198 [2018-11-18 09:29:34,063 INFO L226 Difference]: Without dead ends: 198 [2018-11-18 09:29:34,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:29:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-18 09:29:34,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2018-11-18 09:29:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-18 09:29:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 198 transitions. [2018-11-18 09:29:34,066 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 198 transitions. Word has length 167 [2018-11-18 09:29:34,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:34,067 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 198 transitions. [2018-11-18 09:29:34,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 09:29:34,067 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2018-11-18 09:29:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 09:29:34,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:34,068 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:34,068 INFO L423 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:34,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:34,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1521845198, now seen corresponding path program 9 times [2018-11-18 09:29:34,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:34,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:34,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:34,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:34,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:34,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:34,186 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:34,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 09:29:34,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-18 09:29:34,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:35,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:35,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:35,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 09:29:35,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 09:29:35,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 09:29:35,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:29:35,055 INFO L87 Difference]: Start difference. First operand 194 states and 198 transitions. Second operand 11 states. [2018-11-18 09:29:35,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:35,085 INFO L93 Difference]: Finished difference Result 204 states and 208 transitions. [2018-11-18 09:29:35,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:29:35,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 173 [2018-11-18 09:29:35,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:35,087 INFO L225 Difference]: With dead ends: 204 [2018-11-18 09:29:35,087 INFO L226 Difference]: Without dead ends: 204 [2018-11-18 09:29:35,087 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:29:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-18 09:29:35,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2018-11-18 09:29:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-18 09:29:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 204 transitions. [2018-11-18 09:29:35,091 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 204 transitions. Word has length 173 [2018-11-18 09:29:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:35,092 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 204 transitions. [2018-11-18 09:29:35,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 09:29:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 204 transitions. [2018-11-18 09:29:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 09:29:35,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:35,093 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:35,093 INFO L423 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:35,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:35,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1950276808, now seen corresponding path program 10 times [2018-11-18 09:29:35,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:35,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:35,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:35,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:35,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:35,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:35,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:35,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 09:29:37,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 09:29:37,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:29:37,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:29:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:37,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:29:37,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 09:29:37,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 09:29:37,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:29:37,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:29:37,986 INFO L87 Difference]: Start difference. First operand 200 states and 204 transitions. Second operand 12 states. [2018-11-18 09:29:38,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:29:38,014 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2018-11-18 09:29:38,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:29:38,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2018-11-18 09:29:38,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:29:38,015 INFO L225 Difference]: With dead ends: 210 [2018-11-18 09:29:38,015 INFO L226 Difference]: Without dead ends: 210 [2018-11-18 09:29:38,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:29:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-18 09:29:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 206. [2018-11-18 09:29:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-18 09:29:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 210 transitions. [2018-11-18 09:29:38,019 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 210 transitions. Word has length 179 [2018-11-18 09:29:38,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:29:38,020 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 210 transitions. [2018-11-18 09:29:38,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 09:29:38,020 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 210 transitions. [2018-11-18 09:29:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-18 09:29:38,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:29:38,021 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:29:38,021 INFO L423 AbstractCegarLoop]: === Iteration 29 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:29:38,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:29:38,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1856899874, now seen corresponding path program 11 times [2018-11-18 09:29:38,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:29:38,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:29:38,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:38,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:29:38,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:29:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:29:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:29:38,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:29:38,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:29:38,142 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 09:30:05,956 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-18 09:30:05,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:30:05,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:30:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-18 09:30:06,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:30:06,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 09:30:06,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 09:30:06,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 09:30:06,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 09:30:06,015 INFO L87 Difference]: Start difference. First operand 206 states and 210 transitions. Second operand 13 states. [2018-11-18 09:30:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:30:06,054 INFO L93 Difference]: Finished difference Result 212 states and 216 transitions. [2018-11-18 09:30:06,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 09:30:06,054 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 185 [2018-11-18 09:30:06,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:30:06,055 INFO L225 Difference]: With dead ends: 212 [2018-11-18 09:30:06,055 INFO L226 Difference]: Without dead ends: 212 [2018-11-18 09:30:06,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 09:30:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-18 09:30:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-11-18 09:30:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-18 09:30:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 216 transitions. [2018-11-18 09:30:06,059 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 216 transitions. Word has length 185 [2018-11-18 09:30:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:30:06,059 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 216 transitions. [2018-11-18 09:30:06,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 09:30:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 216 transitions. [2018-11-18 09:30:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-18 09:30:06,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:30:06,061 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:30:06,061 INFO L423 AbstractCegarLoop]: === Iteration 30 === [getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-18 09:30:06,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:30:06,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1971070068, now seen corresponding path program 12 times [2018-11-18 09:30:06,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:30:06,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:30:06,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:30:06,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:30:06,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:30:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:30:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:30:06,257 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 09:30:06,284 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-18 09:30:06,285 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-18 09:30:06,285 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-18 09:30:06,285 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-18 09:30:06,285 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 112 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-18 09:30:06,286 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 109 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-18 09:30:06,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:30:06 BoogieIcfgContainer [2018-11-18 09:30:06,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:30:06,316 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:30:06,316 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:30:06,316 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:30:06,316 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:29:17" (3/4) ... [2018-11-18 09:30:06,320 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 09:30:06,326 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-18 09:30:06,327 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 112 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-18 09:30:06,327 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-18 09:30:06,327 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 109 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-18 09:30:06,327 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-18 09:30:06,327 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-18 09:30:06,370 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_859c87c9-ac49-4ec5-9a9e-7f500f6b40b1/bin-2019/uautomizer/witness.graphml [2018-11-18 09:30:06,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:30:06,371 INFO L168 Benchmark]: Toolchain (without parser) took 49766.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 958.1 MB in the beginning and 905.4 MB in the end (delta: 52.7 MB). Peak memory consumption was 377.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:30:06,371 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:30:06,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.85 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:30:06,372 INFO L168 Benchmark]: Boogie Preprocessor took 24.97 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:30:06,372 INFO L168 Benchmark]: RCFGBuilder took 350.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:30:06,372 INFO L168 Benchmark]: TraceAbstraction took 49176.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 923.1 MB in the end (delta: 194.8 MB). Peak memory consumption was 374.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:30:06,372 INFO L168 Benchmark]: Witness Printer took 54.83 ms. Allocated memory is still 1.4 GB. Free memory was 923.1 MB in the beginning and 905.4 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:30:06,374 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.85 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.97 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 350.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49176.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 923.1 MB in the end (delta: 194.8 MB). Peak memory consumption was 374.1 MB. Max. memory is 11.5 GB. * Witness Printer took 54.83 ms. Allocated memory is still 1.4 GB. Free memory was 923.1 MB in the beginning and 905.4 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 112 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 109 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 112 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 109 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 38]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L48] FCALL "%d\n" [L6] FCALL static int array[10]; [L17] FCALL static int numbers2[10]; [L36] FCALL static int numbers4[10]; VAL ["%d\n"={110:0}, \old("%d\n")=106, \old("%d\n")=107, \old(array)=null, \old(array)=null, \old(numbers2)=null, \old(numbers2)=null, \old(numbers4)=null, \old(numbers4)=null, array={1:0}, numbers2={108:0}, numbers4={111:0}] [L45] CALL getNumbers4() VAL ["%d\n"={110:0}, array={1:0}, numbers2={108:0}, numbers4={111:0}] [L35] CALL, EXPR getNumbers3() VAL ["%d\n"={110:0}, array={1:0}, numbers2={108:0}, numbers4={111:0}] [L25] CALL, EXPR getNumbers2() VAL ["%d\n"={110:0}, array={1:0}, numbers2={108:0}, numbers4={111:0}] [L16] CALL, EXPR getNumbers() VAL ["%d\n"={110:0}, array={1:0}, numbers2={108:0}, numbers4={111:0}] [L8] int i = 0; VAL ["%d\n"={110:0}, array={1:0}, i=0, numbers2={108:0}, numbers4={111:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=0, numbers2={108:0}, numbers4={111:0}] [L9] FCALL array[i] = i VAL ["%d\n"={110:0}, array={1:0}, i=0, numbers2={108:0}, numbers4={111:0}] [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, i=1, numbers2={108:0}, numbers4={111:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=1, numbers2={108:0}, numbers4={111:0}] [L9] FCALL array[i] = i VAL ["%d\n"={110:0}, array={1:0}, i=1, numbers2={108:0}, numbers4={111:0}] [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, i=2, numbers2={108:0}, numbers4={111:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=2, numbers2={108:0}, numbers4={111:0}] [L9] FCALL array[i] = i VAL ["%d\n"={110:0}, array={1:0}, i=2, numbers2={108:0}, numbers4={111:0}] [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, i=3, numbers2={108:0}, numbers4={111:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=3, numbers2={108:0}, numbers4={111:0}] [L9] FCALL array[i] = i VAL ["%d\n"={110:0}, array={1:0}, i=3, numbers2={108:0}, numbers4={111:0}] [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, i=4, numbers2={108:0}, numbers4={111:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=4, numbers2={108:0}, numbers4={111:0}] [L9] FCALL array[i] = i VAL ["%d\n"={110:0}, array={1:0}, i=4, numbers2={108:0}, numbers4={111:0}] [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, i=5, numbers2={108:0}, numbers4={111:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=5, numbers2={108:0}, numbers4={111:0}] [L9] FCALL array[i] = i VAL ["%d\n"={110:0}, array={1:0}, i=5, numbers2={108:0}, numbers4={111:0}] [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, i=6, numbers2={108:0}, numbers4={111:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=6, numbers2={108:0}, numbers4={111:0}] [L9] FCALL array[i] = i VAL ["%d\n"={110:0}, array={1:0}, i=6, numbers2={108:0}, numbers4={111:0}] [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, i=7, numbers2={108:0}, numbers4={111:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=7, numbers2={108:0}, numbers4={111:0}] [L9] FCALL array[i] = i VAL ["%d\n"={110:0}, array={1:0}, i=7, numbers2={108:0}, numbers4={111:0}] [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, i=8, numbers2={108:0}, numbers4={111:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=8, numbers2={108:0}, numbers4={111:0}] [L9] FCALL array[i] = i VAL ["%d\n"={110:0}, array={1:0}, i=8, numbers2={108:0}, numbers4={111:0}] [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, i=9, numbers2={108:0}, numbers4={111:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=9, numbers2={108:0}, numbers4={111:0}] [L9] FCALL array[i] = i VAL ["%d\n"={110:0}, array={1:0}, i=9, numbers2={108:0}, numbers4={111:0}] [L8] ++i VAL ["%d\n"={110:0}, array={1:0}, i=10, numbers2={108:0}, numbers4={111:0}] [L8] COND FALSE !(i < 10) VAL ["%d\n"={110:0}, array={1:0}, i=10, numbers2={108:0}, numbers4={111:0}] [L12] RET return array; VAL ["%d\n"={110:0}, \result={1:0}, array={1:0}, i=10, numbers2={108:0}, numbers4={111:0}] [L16] EXPR getNumbers() VAL ["%d\n"={110:0}, array={1:0}, getNumbers()={1:0}, numbers2={108:0}, numbers4={111:0}] [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL ["%d\n"={110:0}, array={1:0}, i=0, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=0, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=0, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=0] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=0, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=0] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, i=1, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=1, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=1, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=1] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=1, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=1] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, i=2, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=2, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=2, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=2] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=2, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=2] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, i=3, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=3, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=3, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=3] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=3, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=3] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, i=4, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=4, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=4, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=4] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=4, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=4] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, i=5, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=5, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=5, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=5] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=5, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=5] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, i=6, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=6, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=6, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=6] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=6, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=6] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, i=7, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=7, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=7, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=7] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=7, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=7] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, i=8, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=8, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=8, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=8] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=8, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=8] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, i=9, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=9, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=9, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=9] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=9, numbers={1:0}, numbers2={108:0}, numbers4={111:0}, numbers[i]=9] [L18] ++i VAL ["%d\n"={110:0}, array={1:0}, i=10, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L18] COND FALSE !(i < 10) VAL ["%d\n"={110:0}, array={1:0}, i=10, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L21] RET return numbers2; VAL ["%d\n"={110:0}, \result={108:0}, array={1:0}, i=10, numbers={1:0}, numbers2={108:0}, numbers4={111:0}] [L25] EXPR getNumbers2() VAL ["%d\n"={110:0}, array={1:0}, getNumbers2()={108:0}, numbers2={108:0}, numbers4={111:0}] [L25] int* numbers = getNumbers2(); [L26] FCALL int numbers3[10]; [L27] int i = 0; VAL ["%d\n"={110:0}, array={1:0}, i=0, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=0, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=0, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=0] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=0, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=0] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, i=1, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=1, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=1, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=1] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=1, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=1] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, i=2, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=2, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=2, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=2] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=2, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=2] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, i=3, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=3, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=3, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=3] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=3, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=3] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, i=4, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=4, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=4, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=4] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=4, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=4] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, i=5, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=5, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=5, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=5] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=5, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=5] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, i=6, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=6, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=6, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=6] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=6, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=6] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, i=7, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=7, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=7, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=7] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=7, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=7] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, i=8, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=8, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=8, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=8] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=8, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=8] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, i=9, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=9, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=9, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=9] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={110:0}, array={1:0}, i=9, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}, numbers[i]=9] [L27] ++i VAL ["%d\n"={110:0}, array={1:0}, i=10, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L27] COND FALSE !(i < 10) VAL ["%d\n"={110:0}, array={1:0}, i=10, numbers={108:0}, numbers2={108:0}, numbers3={105:0}, numbers4={111:0}] [L31] return numbers3; [L31] RET return numbers3; VAL ["%d\n"={110:0}, \result={105:0}, array={1:0}, i=10, numbers={108:0}, numbers2={108:0}, numbers4={111:0}] [L35] EXPR getNumbers3() VAL ["%d\n"={110:0}, array={1:0}, getNumbers3()={105:0}, numbers2={108:0}, numbers4={111:0}] [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL ["%d\n"={110:0}, array={1:0}, i=0, numbers={105:0}, numbers2={108:0}, numbers4={111:0}] [L37] COND TRUE i < 10 VAL ["%d\n"={110:0}, array={1:0}, i=0, numbers={105:0}, numbers2={108:0}, numbers4={111:0}] [L38] FCALL numbers[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 75 locations, 17 error locations. UNSAFE Result, 49.1s OverallTime, 30 OverallIterations, 11 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1758 SDtfs, 1083 SDslu, 8746 SDs, 0 SdLazy, 2291 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2769 GetRequests, 2498 SyntacticMatches, 13 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 76 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 36.9s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 5382 NumberOfCodeBlocks, 4972 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 5137 ConstructedInterpolants, 333 QuantifiedInterpolants, 3336901 SizeOfPredicates, 69 NumberOfNonLiveVariables, 7458 ConjunctsInSsa, 274 ConjunctsInUnsatCore, 54 InterpolantComputations, 11 PerfectInterpolantSequences, 12462/16100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...