./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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_640a5335-1463-4c98-90b8-33fd06f08867/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-1dbac8b [2018-10-27 04:45:22,365 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:45:22,366 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:45:22,374 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:45:22,375 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:45:22,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:45:22,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:45:22,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:45:22,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:45:22,379 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:45:22,380 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:45:22,380 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:45:22,381 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:45:22,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:45:22,382 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:45:22,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:45:22,384 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:45:22,385 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:45:22,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:45:22,387 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:45:22,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:45:22,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:45:22,390 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:45:22,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:45:22,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:45:22,391 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:45:22,392 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:45:22,393 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:45:22,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:45:22,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:45:22,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:45:22,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:45:22,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:45:22,395 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:45:22,396 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:45:22,396 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:45:22,396 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-27 04:45:22,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:45:22,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:45:22,407 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:45:22,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:45:22,408 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 04:45:22,408 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:45:22,408 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:45:22,408 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:45:22,408 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:45:22,408 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:45:22,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:45:22,409 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:45:22,409 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:45:22,409 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:45:22,409 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:45:22,409 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:45:22,409 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:45:22,409 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:45:22,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:45:22,410 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:45:22,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:45:22,410 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:45:22,410 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:45:22,410 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 04:45:22,410 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:45:22,410 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_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:22,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:45:22,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:45:22,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:45:22,447 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:45:22,447 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:45:22,448 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2018-10-27 04:45:22,492 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/bin-2019/uautomizer/data/e7f2d6ea3/279e37b6cd354f6c8396e0b1402d5e10/FLAG51f11f4a2 [2018-10-27 04:45:22,865 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:45:22,866 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/sv-benchmarks/c/memsafety-ext3/getNumbers4_false-valid-deref.c [2018-10-27 04:45:22,870 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/bin-2019/uautomizer/data/e7f2d6ea3/279e37b6cd354f6c8396e0b1402d5e10/FLAG51f11f4a2 [2018-10-27 04:45:22,881 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/bin-2019/uautomizer/data/e7f2d6ea3/279e37b6cd354f6c8396e0b1402d5e10 [2018-10-27 04:45:22,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:45:22,884 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 04:45:22,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:45:22,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:45:22,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:45:22,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:45:22" (1/1) ... [2018-10-27 04:45:22,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40893eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:22, skipping insertion in model container [2018-10-27 04:45:22,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:45:22" (1/1) ... [2018-10-27 04:45:22,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:45:22,923 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:45:23,044 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:45:23,054 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:45:23,070 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:45:23,088 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:45:23,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:23 WrapperNode [2018-10-27 04:45:23,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:45:23,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:45:23,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:45:23,089 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:45:23,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:23" (1/1) ... [2018-10-27 04:45:23,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:23" (1/1) ... [2018-10-27 04:45:23,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:23" (1/1) ... [2018-10-27 04:45:23,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:23" (1/1) ... [2018-10-27 04:45:23,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:23" (1/1) ... [2018-10-27 04:45:23,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:23" (1/1) ... [2018-10-27 04:45:23,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:23" (1/1) ... [2018-10-27 04:45:23,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:45:23,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:45:23,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:45:23,154 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:45:23,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:23,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:45:23,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:45:23,290 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-10-27 04:45:23,290 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-10-27 04:45:23,290 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-10-27 04:45:23,291 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-10-27 04:45:23,291 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:45:23,291 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-10-27 04:45:23,291 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-10-27 04:45:23,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 04:45:23,291 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-10-27 04:45:23,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 04:45:23,291 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-10-27 04:45:23,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-27 04:45:23,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-27 04:45:23,292 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-10-27 04:45:23,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:45:23,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:45:23,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-27 04:45:23,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:45:24,087 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:45:24,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:24 BoogieIcfgContainer [2018-10-27 04:45:24,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:45:24,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:45:24,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:45:24,091 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:45:24,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:45:22" (1/3) ... [2018-10-27 04:45:24,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fab8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:45:24, skipping insertion in model container [2018-10-27 04:45:24,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:23" (2/3) ... [2018-10-27 04:45:24,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fab8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:45:24, skipping insertion in model container [2018-10-27 04:45:24,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:24" (3/3) ... [2018-10-27 04:45:24,094 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_false-valid-deref.c [2018-10-27 04:45:24,102 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:45:24,109 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-10-27 04:45:24,121 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-10-27 04:45:24,143 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 04:45:24,143 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:45:24,144 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:45:24,144 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:45:24,144 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:45:24,144 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:45:24,144 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:45:24,144 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:45:24,144 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:45:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-10-27 04:45:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 04:45:24,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:24,169 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:24,171 INFO L424 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:24,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:24,176 INFO L82 PathProgramCache]: Analyzing trace with hash 632035808, now seen corresponding path program 1 times [2018-10-27 04:45:24,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:24,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:24,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:24,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:24,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:24,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:24,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:24,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:24,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:24,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:24,584 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 4 states. [2018-10-27 04:45:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:24,805 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-10-27 04:45:24,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:24,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-10-27 04:45:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:24,815 INFO L225 Difference]: With dead ends: 113 [2018-10-27 04:45:24,816 INFO L226 Difference]: Without dead ends: 110 [2018-10-27 04:45:24,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-27 04:45:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-10-27 04:45:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-27 04:45:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-10-27 04:45:24,847 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 48 [2018-10-27 04:45:24,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:24,847 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-10-27 04:45:24,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-10-27 04:45:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 04:45:24,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:24,849 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:24,849 INFO L424 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:24,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:24,849 INFO L82 PathProgramCache]: Analyzing trace with hash 632035809, now seen corresponding path program 1 times [2018-10-27 04:45:24,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:24,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:24,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:24,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:24,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:25,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:25,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:25,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:45:25,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:45:25,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:25,182 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 6 states. [2018-10-27 04:45:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:25,759 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-10-27 04:45:25,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:25,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-10-27 04:45:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:25,762 INFO L225 Difference]: With dead ends: 114 [2018-10-27 04:45:25,762 INFO L226 Difference]: Without dead ends: 114 [2018-10-27 04:45:25,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-27 04:45:25,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-10-27 04:45:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-27 04:45:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-10-27 04:45:25,772 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 48 [2018-10-27 04:45:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:25,772 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-10-27 04:45:25,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:45:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-10-27 04:45:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 04:45:25,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:25,774 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:25,774 INFO L424 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:25,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash -595119304, now seen corresponding path program 1 times [2018-10-27 04:45:25,774 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:25,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:25,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:26,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:26,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:45:26,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:45:26,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:45:26,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:26,006 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 8 states. [2018-10-27 04:45:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:26,548 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-10-27 04:45:26,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:45:26,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-10-27 04:45:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:26,550 INFO L225 Difference]: With dead ends: 113 [2018-10-27 04:45:26,551 INFO L226 Difference]: Without dead ends: 113 [2018-10-27 04:45:26,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:45:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-27 04:45:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-10-27 04:45:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-27 04:45:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-10-27 04:45:26,564 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 52 [2018-10-27 04:45:26,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:26,565 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-10-27 04:45:26,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:45:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-10-27 04:45:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 04:45:26,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:26,566 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:26,566 INFO L424 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:26,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:26,567 INFO L82 PathProgramCache]: Analyzing trace with hash 357877774, now seen corresponding path program 1 times [2018-10-27 04:45:26,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:26,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:26,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:26,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:26,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:26,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:26,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:26,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:45:26,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:45:26,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:26,733 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 6 states. [2018-10-27 04:45:27,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:27,008 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-10-27 04:45:27,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:27,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-10-27 04:45:27,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:27,010 INFO L225 Difference]: With dead ends: 110 [2018-10-27 04:45:27,010 INFO L226 Difference]: Without dead ends: 110 [2018-10-27 04:45:27,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:45:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-27 04:45:27,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-10-27 04:45:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-27 04:45:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-10-27 04:45:27,018 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 58 [2018-10-27 04:45:27,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:27,018 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-10-27 04:45:27,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:45:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-10-27 04:45:27,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 04:45:27,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:27,020 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:27,020 INFO L424 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:27,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:27,020 INFO L82 PathProgramCache]: Analyzing trace with hash 357877775, now seen corresponding path program 1 times [2018-10-27 04:45:27,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:27,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:27,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:27,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:27,096 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:27,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:27,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:27,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:27,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-10-27 04:45:27,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:27,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:27,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:27,335 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 5 states. [2018-10-27 04:45:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:27,459 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-10-27 04:45:27,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:27,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-10-27 04:45:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:27,461 INFO L225 Difference]: With dead ends: 116 [2018-10-27 04:45:27,461 INFO L226 Difference]: Without dead ends: 116 [2018-10-27 04:45:27,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-27 04:45:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-10-27 04:45:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-27 04:45:27,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2018-10-27 04:45:27,469 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 58 [2018-10-27 04:45:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:27,470 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2018-10-27 04:45:27,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2018-10-27 04:45:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-27 04:45:27,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:27,471 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:27,471 INFO L424 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:27,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:27,471 INFO L82 PathProgramCache]: Analyzing trace with hash 631070886, now seen corresponding path program 2 times [2018-10-27 04:45:27,472 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:27,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:27,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:27,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:27,612 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:27,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:45:27,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-27 04:45:27,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:27,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:27,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:45:27,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:27,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:45:27,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:27,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:27,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:45:27,841 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:27,842 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:27,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:45:27,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:27,855 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-27 04:45:27,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:27,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:27,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:28 [2018-10-27 04:45:27,910 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:27,911 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:27,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:27,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 04:45:27,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:27,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-10-27 04:45:27,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:27,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:27,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:31 [2018-10-27 04:45:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 04:45:28,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:45:28,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2018-10-27 04:45:28,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:45:28,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:45:28,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:45:28,675 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand 12 states. [2018-10-27 04:45:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:29,394 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-10-27 04:45:29,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 04:45:29,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-10-27 04:45:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:29,396 INFO L225 Difference]: With dead ends: 121 [2018-10-27 04:45:29,396 INFO L226 Difference]: Without dead ends: 121 [2018-10-27 04:45:29,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:45:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-27 04:45:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-10-27 04:45:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-27 04:45:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-10-27 04:45:29,402 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 62 [2018-10-27 04:45:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:29,402 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-10-27 04:45:29,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:45:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-10-27 04:45:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-27 04:45:29,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:29,404 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:29,404 INFO L424 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:29,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:29,404 INFO L82 PathProgramCache]: Analyzing trace with hash -854531546, now seen corresponding path program 1 times [2018-10-27 04:45:29,404 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:29,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:29,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:29,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:29,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:29,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:29,573 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:29,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:29,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:29,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:29,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-10-27 04:45:29,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:45:29,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:45:29,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:45:29,638 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 7 states. [2018-10-27 04:45:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:29,653 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-10-27 04:45:29,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:29,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-10-27 04:45:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:29,654 INFO L225 Difference]: With dead ends: 125 [2018-10-27 04:45:29,654 INFO L226 Difference]: Without dead ends: 125 [2018-10-27 04:45:29,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:45:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-27 04:45:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-27 04:45:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-27 04:45:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-10-27 04:45:29,658 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 67 [2018-10-27 04:45:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:29,659 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-10-27 04:45:29,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:45:29,659 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-10-27 04:45:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-27 04:45:29,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:29,660 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:29,660 INFO L424 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:29,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:29,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1078264687, now seen corresponding path program 2 times [2018-10-27 04:45:29,660 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:29,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:29,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:29,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:29,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:29,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:29,764 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:29,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:45:29,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-27 04:45:29,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:29,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:29,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:45:29,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:29,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:29,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:45:29,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:45:29,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:29,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:29,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-10-27 04:45:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-27 04:45:29,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:45:29,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2018-10-27 04:45:29,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:45:29,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:45:29,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:29,946 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 8 states. [2018-10-27 04:45:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:30,061 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-10-27 04:45:30,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:45:30,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-10-27 04:45:30,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:30,063 INFO L225 Difference]: With dead ends: 128 [2018-10-27 04:45:30,063 INFO L226 Difference]: Without dead ends: 128 [2018-10-27 04:45:30,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:45:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-27 04:45:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-10-27 04:45:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-27 04:45:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2018-10-27 04:45:30,074 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 71 [2018-10-27 04:45:30,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:30,074 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2018-10-27 04:45:30,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:45:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-10-27 04:45:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-27 04:45:30,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:30,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:30,076 INFO L424 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:30,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:30,076 INFO L82 PathProgramCache]: Analyzing trace with hash -830121927, now seen corresponding path program 1 times [2018-10-27 04:45:30,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:30,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:30,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:30,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:30,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:30,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:30,304 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:30,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:30,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:30,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:30,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-27 04:45:30,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:45:30,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:45:30,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:45:30,397 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand 9 states. [2018-10-27 04:45:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:30,458 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-10-27 04:45:30,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:45:30,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-10-27 04:45:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:30,460 INFO L225 Difference]: With dead ends: 132 [2018-10-27 04:45:30,460 INFO L226 Difference]: Without dead ends: 132 [2018-10-27 04:45:30,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:45:30,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-27 04:45:30,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-10-27 04:45:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-27 04:45:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2018-10-27 04:45:30,464 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 75 [2018-10-27 04:45:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:30,464 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2018-10-27 04:45:30,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:45:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-10-27 04:45:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-27 04:45:30,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:30,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:30,465 INFO L424 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:30,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:30,466 INFO L82 PathProgramCache]: Analyzing trace with hash -410247038, now seen corresponding path program 2 times [2018-10-27 04:45:30,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:30,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:30,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:30,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:30,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:31,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:31,100 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:31,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:45:31,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-27 04:45:31,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:31,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:31,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:45:31,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:31,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:45:31,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:31,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:31,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:45:31,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:31,229 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:31,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:45:31,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:31,306 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-27 04:45:31,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:31,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:31,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-10-27 04:45:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-27 04:45:31,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:45:31,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2018-10-27 04:45:31,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:45:31,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:45:31,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:45:31,447 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand 13 states. [2018-10-27 04:45:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:31,884 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-10-27 04:45:31,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:45:31,885 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-10-27 04:45:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:31,886 INFO L225 Difference]: With dead ends: 135 [2018-10-27 04:45:31,886 INFO L226 Difference]: Without dead ends: 135 [2018-10-27 04:45:31,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-10-27 04:45:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-27 04:45:31,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-10-27 04:45:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-27 04:45:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2018-10-27 04:45:31,889 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 79 [2018-10-27 04:45:31,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:31,890 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2018-10-27 04:45:31,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:45:31,890 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-10-27 04:45:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 04:45:31,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:31,891 INFO L375 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:31,891 INFO L424 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:31,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:31,892 INFO L82 PathProgramCache]: Analyzing trace with hash -577435457, now seen corresponding path program 1 times [2018-10-27 04:45:31,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:31,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:31,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:31,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:31,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:45:32,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:32,061 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:32,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:32,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:45:32,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:32,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-10-27 04:45:32,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:45:32,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:45:32,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:32,132 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 11 states. [2018-10-27 04:45:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:32,179 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-10-27 04:45:32,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:45:32,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-10-27 04:45:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:32,180 INFO L225 Difference]: With dead ends: 139 [2018-10-27 04:45:32,180 INFO L226 Difference]: Without dead ends: 139 [2018-10-27 04:45:32,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-27 04:45:32,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-10-27 04:45:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-27 04:45:32,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-10-27 04:45:32,184 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 96 [2018-10-27 04:45:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:32,187 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-10-27 04:45:32,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:45:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-10-27 04:45:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-27 04:45:32,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:32,189 INFO L375 BasicCegarLoop]: trace histogram [9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:32,189 INFO L424 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:32,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:32,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1707247594, now seen corresponding path program 2 times [2018-10-27 04:45:32,190 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:32,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:32,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:32,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:45:32,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:32,454 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:32,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:45:32,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-27 04:45:32,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:32,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:32,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:45:32,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:32,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:32,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:45:32,501 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:32,502 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:32,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-27 04:45:32,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:32,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:32,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-10-27 04:45:32,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-10-27 04:45:32,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:32,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:32,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-10-27 04:45:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-10-27 04:45:32,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:45:32,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2018-10-27 04:45:32,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:45:32,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:45:32,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:45:32,692 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 16 states. [2018-10-27 04:45:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:33,119 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-10-27 04:45:33,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:45:33,120 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 100 [2018-10-27 04:45:33,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:33,120 INFO L225 Difference]: With dead ends: 142 [2018-10-27 04:45:33,121 INFO L226 Difference]: Without dead ends: 142 [2018-10-27 04:45:33,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-27 04:45:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-27 04:45:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-10-27 04:45:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-27 04:45:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-10-27 04:45:33,124 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 100 [2018-10-27 04:45:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:33,125 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-10-27 04:45:33,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:45:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-10-27 04:45:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 04:45:33,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:33,128 INFO L375 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:33,128 INFO L424 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:33,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:33,129 INFO L82 PathProgramCache]: Analyzing trace with hash -471833618, now seen corresponding path program 1 times [2018-10-27 04:45:33,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:33,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:33,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:33,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:33,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:45:33,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:33,615 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:33,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:33,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:45:33,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:33,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-10-27 04:45:33,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:45:33,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:45:33,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:45:33,688 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 13 states. [2018-10-27 04:45:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:33,732 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2018-10-27 04:45:33,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:45:33,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2018-10-27 04:45:33,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:33,733 INFO L225 Difference]: With dead ends: 144 [2018-10-27 04:45:33,733 INFO L226 Difference]: Without dead ends: 144 [2018-10-27 04:45:33,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:45:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-27 04:45:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-10-27 04:45:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-27 04:45:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2018-10-27 04:45:33,738 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 104 [2018-10-27 04:45:33,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:33,739 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2018-10-27 04:45:33,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:45:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2018-10-27 04:45:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-27 04:45:33,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:33,740 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:33,740 INFO L424 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:33,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:33,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2014606267, now seen corresponding path program 2 times [2018-10-27 04:45:33,740 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:33,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:33,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:33,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:33,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-10-27 04:45:33,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:33,887 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:33,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:45:33,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-27 04:45:33,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:33,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:33,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:45:33,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:33,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:45:33,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:33,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:33,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:45:33,990 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:33,990 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-27 04:45:33,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:33,997 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:33,998 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:33,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 04:45:33,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:34,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:34,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-10-27 04:45:34,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-10-27 04:45:34,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:34,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:34,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:23 [2018-10-27 04:45:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-10-27 04:45:34,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:45:34,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 11 [2018-10-27 04:45:34,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:45:34,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:45:34,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:34,297 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand 11 states. [2018-10-27 04:45:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:34,719 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-10-27 04:45:34,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 04:45:34,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2018-10-27 04:45:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:34,720 INFO L225 Difference]: With dead ends: 155 [2018-10-27 04:45:34,720 INFO L226 Difference]: Without dead ends: 155 [2018-10-27 04:45:34,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:45:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-27 04:45:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2018-10-27 04:45:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-27 04:45:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2018-10-27 04:45:34,723 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 108 [2018-10-27 04:45:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:34,723 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2018-10-27 04:45:34,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:45:34,723 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-10-27 04:45:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-27 04:45:34,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:34,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:34,724 INFO L424 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:34,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:34,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2079049901, now seen corresponding path program 1 times [2018-10-27 04:45:34,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:34,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:34,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:34,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:34,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-27 04:45:34,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:34,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:45:34,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:45:34,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:45:34,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:45:34,808 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 3 states. [2018-10-27 04:45:34,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:34,825 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-10-27 04:45:34,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:45:34,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-10-27 04:45:34,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:34,826 INFO L225 Difference]: With dead ends: 150 [2018-10-27 04:45:34,826 INFO L226 Difference]: Without dead ends: 150 [2018-10-27 04:45:34,827 INFO L605 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-10-27 04:45:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-27 04:45:34,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-10-27 04:45:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-27 04:45:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2018-10-27 04:45:34,830 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 115 [2018-10-27 04:45:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:34,830 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2018-10-27 04:45:34,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:45:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-10-27 04:45:34,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-27 04:45:34,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:34,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:34,831 INFO L424 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:34,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:34,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2079049902, now seen corresponding path program 1 times [2018-10-27 04:45:34,831 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:34,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:34,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:34,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:34,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:35,007 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-10-27 04:45:35,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:35,007 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:35,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:35,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-10-27 04:45:35,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:35,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-10-27 04:45:35,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:45:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:45:35,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:35,074 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 6 states. [2018-10-27 04:45:35,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:35,096 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2018-10-27 04:45:35,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:35,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-10-27 04:45:35,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:35,097 INFO L225 Difference]: With dead ends: 160 [2018-10-27 04:45:35,097 INFO L226 Difference]: Without dead ends: 160 [2018-10-27 04:45:35,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-27 04:45:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-10-27 04:45:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-27 04:45:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2018-10-27 04:45:35,100 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 115 [2018-10-27 04:45:35,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:35,100 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2018-10-27 04:45:35,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:45:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-10-27 04:45:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-27 04:45:35,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:35,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:35,102 INFO L424 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:35,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:35,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2020717224, now seen corresponding path program 2 times [2018-10-27 04:45:35,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:35,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:35,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:35,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:35,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-10-27 04:45:35,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:35,536 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:45:35,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:45:35,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-27 04:45:35,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:35,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:35,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:45:35,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:35,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:35,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:45:36,089 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 04:45:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-10-27 04:45:36,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:45:36,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2018-10-27 04:45:36,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:45:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:45:36,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:45:36,247 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand 9 states. [2018-10-27 04:45:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:36,317 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2018-10-27 04:45:36,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:45:36,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2018-10-27 04:45:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:36,319 INFO L225 Difference]: With dead ends: 165 [2018-10-27 04:45:36,319 INFO L226 Difference]: Without dead ends: 165 [2018-10-27 04:45:36,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:45:36,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-27 04:45:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2018-10-27 04:45:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-27 04:45:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2018-10-27 04:45:36,323 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 121 [2018-10-27 04:45:36,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:36,323 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2018-10-27 04:45:36,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:45:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2018-10-27 04:45:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-27 04:45:36,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:36,324 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:36,324 INFO L424 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:36,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:36,325 INFO L82 PathProgramCache]: Analyzing trace with hash 860056674, now seen corresponding path program 1 times [2018-10-27 04:45:36,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:36,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:36,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:36,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:36,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-10-27 04:45:36,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:36,504 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:36,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:36,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-10-27 04:45:36,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:36,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-27 04:45:36,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:45:36,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:45:36,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:36,578 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 8 states. [2018-10-27 04:45:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:36,620 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-10-27 04:45:36,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:45:36,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 140 [2018-10-27 04:45:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:36,624 INFO L225 Difference]: With dead ends: 171 [2018-10-27 04:45:36,624 INFO L226 Difference]: Without dead ends: 171 [2018-10-27 04:45:36,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:36,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-27 04:45:36,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-10-27 04:45:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-27 04:45:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2018-10-27 04:45:36,628 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 140 [2018-10-27 04:45:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:36,628 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2018-10-27 04:45:36,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:45:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2018-10-27 04:45:36,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-27 04:45:36,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:36,632 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:36,632 INFO L424 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:36,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:36,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1796119288, now seen corresponding path program 2 times [2018-10-27 04:45:36,633 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:36,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:36,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:36,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:36,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-10-27 04:45:36,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:36,751 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:36,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:45:37,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 04:45:37,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:37,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-10-27 04:45:37,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:37,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2018-10-27 04:45:37,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:45:37,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:45:37,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:45:37,495 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 10 states. [2018-10-27 04:45:37,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:37,544 INFO L93 Difference]: Finished difference Result 187 states and 191 transitions. [2018-10-27 04:45:37,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:45:37,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2018-10-27 04:45:37,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:37,546 INFO L225 Difference]: With dead ends: 187 [2018-10-27 04:45:37,546 INFO L226 Difference]: Without dead ends: 187 [2018-10-27 04:45:37,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:45:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-27 04:45:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 179. [2018-10-27 04:45:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-27 04:45:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 183 transitions. [2018-10-27 04:45:37,549 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 183 transitions. Word has length 146 [2018-10-27 04:45:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:37,550 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 183 transitions. [2018-10-27 04:45:37,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:45:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2018-10-27 04:45:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-27 04:45:37,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:37,551 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:37,551 INFO L424 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:37,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash 165943748, now seen corresponding path program 3 times [2018-10-27 04:45:37,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:37,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:37,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:37,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:37,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-27 04:45:37,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:37,960 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:37,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:45:38,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 04:45:38,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:38,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-10-27 04:45:38,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:38,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-10-27 04:45:38,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:45:38,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:45:38,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:45:38,686 INFO L87 Difference]: Start difference. First operand 179 states and 183 transitions. Second operand 12 states. [2018-10-27 04:45:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:38,763 INFO L93 Difference]: Finished difference Result 199 states and 203 transitions. [2018-10-27 04:45:38,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:45:38,765 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 158 [2018-10-27 04:45:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:38,766 INFO L225 Difference]: With dead ends: 199 [2018-10-27 04:45:38,766 INFO L226 Difference]: Without dead ends: 199 [2018-10-27 04:45:38,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:45:38,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-27 04:45:38,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 191. [2018-10-27 04:45:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-27 04:45:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2018-10-27 04:45:38,772 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 158 [2018-10-27 04:45:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:38,773 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2018-10-27 04:45:38,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:45:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2018-10-27 04:45:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-27 04:45:38,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:38,774 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:38,774 INFO L424 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:38,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:38,774 INFO L82 PathProgramCache]: Analyzing trace with hash 726441616, now seen corresponding path program 4 times [2018-10-27 04:45:38,774 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:38,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:38,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:38,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:38,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-10-27 04:45:38,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:38,912 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:38,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:45:38,953 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:45:38,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:38,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-10-27 04:45:38,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:38,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-10-27 04:45:38,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:45:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:45:38,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:38,992 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 11 states. [2018-10-27 04:45:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:39,025 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2018-10-27 04:45:39,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:45:39,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 170 [2018-10-27 04:45:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:39,027 INFO L225 Difference]: With dead ends: 201 [2018-10-27 04:45:39,027 INFO L226 Difference]: Without dead ends: 201 [2018-10-27 04:45:39,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-27 04:45:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2018-10-27 04:45:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-27 04:45:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2018-10-27 04:45:39,031 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 170 [2018-10-27 04:45:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:39,031 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2018-10-27 04:45:39,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:45:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2018-10-27 04:45:39,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-27 04:45:39,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:39,032 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:39,032 INFO L424 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:39,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:39,033 INFO L82 PathProgramCache]: Analyzing trace with hash 37266086, now seen corresponding path program 5 times [2018-10-27 04:45:39,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:39,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:39,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:39,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:39,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-10-27 04:45:39,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:39,489 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:39,497 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 04:45:40,805 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-10-27 04:45:40,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:40,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-10-27 04:45:41,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:41,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2018-10-27 04:45:41,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 04:45:41,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 04:45:41,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:45:41,170 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand 15 states. [2018-10-27 04:45:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:41,236 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2018-10-27 04:45:41,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:45:41,237 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 176 [2018-10-27 04:45:41,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:41,240 INFO L225 Difference]: With dead ends: 217 [2018-10-27 04:45:41,240 INFO L226 Difference]: Without dead ends: 217 [2018-10-27 04:45:41,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:45:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-27 04:45:41,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 209. [2018-10-27 04:45:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-27 04:45:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 213 transitions. [2018-10-27 04:45:41,244 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 213 transitions. Word has length 176 [2018-10-27 04:45:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:41,244 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 213 transitions. [2018-10-27 04:45:41,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 04:45:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 213 transitions. [2018-10-27 04:45:41,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-27 04:45:41,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:41,246 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:41,246 INFO L424 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:41,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:41,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1900692366, now seen corresponding path program 6 times [2018-10-27 04:45:41,246 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:41,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:41,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:41,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:41,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-10-27 04:45:41,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:41,472 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:41,479 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 04:45:46,676 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-27 04:45:46,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:46,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 50 proven. 44 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-10-27 04:45:46,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:46,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-10-27 04:45:46,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-27 04:45:46,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 04:45:46,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2018-10-27 04:45:46,996 INFO L87 Difference]: Start difference. First operand 209 states and 213 transitions. Second operand 25 states. [2018-10-27 04:45:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:47,487 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2018-10-27 04:45:47,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 04:45:47,489 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 188 [2018-10-27 04:45:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:47,490 INFO L225 Difference]: With dead ends: 225 [2018-10-27 04:45:47,490 INFO L226 Difference]: Without dead ends: 225 [2018-10-27 04:45:47,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=913, Unknown=0, NotChecked=0, Total=1190 [2018-10-27 04:45:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-27 04:45:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 221. [2018-10-27 04:45:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-27 04:45:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2018-10-27 04:45:47,494 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 188 [2018-10-27 04:45:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:47,495 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2018-10-27 04:45:47,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-27 04:45:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2018-10-27 04:45:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-27 04:45:47,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:47,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:47,496 INFO L424 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:47,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:47,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1018256446, now seen corresponding path program 7 times [2018-10-27 04:45:47,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:47,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:47,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:47,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:47,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-10-27 04:45:48,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:48,272 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:48,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:48,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-10-27 04:45:48,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:48,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-27 04:45:48,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:45:48,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:45:48,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:45:48,510 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 9 states. [2018-10-27 04:45:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:48,827 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2018-10-27 04:45:48,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:45:48,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2018-10-27 04:45:48,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:48,830 INFO L225 Difference]: With dead ends: 231 [2018-10-27 04:45:48,830 INFO L226 Difference]: Without dead ends: 231 [2018-10-27 04:45:48,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:45:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-27 04:45:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2018-10-27 04:45:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-27 04:45:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2018-10-27 04:45:48,833 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 200 [2018-10-27 04:45:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:48,833 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2018-10-27 04:45:48,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:45:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2018-10-27 04:45:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-27 04:45:48,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:48,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:48,835 INFO L424 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:48,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:48,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2020233460, now seen corresponding path program 8 times [2018-10-27 04:45:48,835 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:48,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:48,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:48,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:48,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-10-27 04:45:48,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:48,988 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:49,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:45:49,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 04:45:49,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:49,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-10-27 04:45:49,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:49,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-10-27 04:45:49,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:45:49,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:45:49,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:45:49,411 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand 10 states. [2018-10-27 04:45:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:49,441 INFO L93 Difference]: Finished difference Result 237 states and 241 transitions. [2018-10-27 04:45:49,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:45:49,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 206 [2018-10-27 04:45:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:49,443 INFO L225 Difference]: With dead ends: 237 [2018-10-27 04:45:49,443 INFO L226 Difference]: Without dead ends: 237 [2018-10-27 04:45:49,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 206 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-10-27 04:45:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-27 04:45:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2018-10-27 04:45:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-27 04:45:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 237 transitions. [2018-10-27 04:45:49,447 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 237 transitions. Word has length 206 [2018-10-27 04:45:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:49,447 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 237 transitions. [2018-10-27 04:45:49,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:45:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2018-10-27 04:45:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-27 04:45:49,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:49,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:49,449 INFO L424 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:49,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:49,449 INFO L82 PathProgramCache]: Analyzing trace with hash 373974314, now seen corresponding path program 9 times [2018-10-27 04:45:49,449 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:49,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:49,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:49,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:49,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-10-27 04:45:50,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:50,165 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:50,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:45:54,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-27 04:45:54,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:54,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-10-27 04:45:54,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:54,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-10-27 04:45:54,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:45:54,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:45:54,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:54,759 INFO L87 Difference]: Start difference. First operand 233 states and 237 transitions. Second operand 11 states. [2018-10-27 04:45:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:54,953 INFO L93 Difference]: Finished difference Result 243 states and 247 transitions. [2018-10-27 04:45:54,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:45:54,957 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 212 [2018-10-27 04:45:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:54,958 INFO L225 Difference]: With dead ends: 243 [2018-10-27 04:45:54,958 INFO L226 Difference]: Without dead ends: 243 [2018-10-27 04:45:54,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-27 04:45:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2018-10-27 04:45:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-27 04:45:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 243 transitions. [2018-10-27 04:45:54,965 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 243 transitions. Word has length 212 [2018-10-27 04:45:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:54,965 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 243 transitions. [2018-10-27 04:45:54,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:45:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 243 transitions. [2018-10-27 04:45:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-27 04:45:54,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:54,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:54,967 INFO L424 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:54,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:54,967 INFO L82 PathProgramCache]: Analyzing trace with hash -245630752, now seen corresponding path program 10 times [2018-10-27 04:45:54,967 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:54,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:54,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:54,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:54,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-10-27 04:45:55,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:55,085 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:55,092 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:45:55,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:45:55,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:55,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-10-27 04:45:55,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:55,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-10-27 04:45:55,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:45:55,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:45:55,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:45:55,259 INFO L87 Difference]: Start difference. First operand 239 states and 243 transitions. Second operand 12 states. [2018-10-27 04:45:55,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:55,548 INFO L93 Difference]: Finished difference Result 249 states and 253 transitions. [2018-10-27 04:45:55,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:45:55,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 218 [2018-10-27 04:45:55,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:55,550 INFO L225 Difference]: With dead ends: 249 [2018-10-27 04:45:55,550 INFO L226 Difference]: Without dead ends: 249 [2018-10-27 04:45:55,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:45:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-27 04:45:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 245. [2018-10-27 04:45:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-27 04:45:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 249 transitions. [2018-10-27 04:45:55,554 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 249 transitions. Word has length 218 [2018-10-27 04:45:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:55,555 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 249 transitions. [2018-10-27 04:45:55,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:45:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 249 transitions. [2018-10-27 04:45:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-27 04:45:55,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:55,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:55,556 INFO L424 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:45:55,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:55,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1264675862, now seen corresponding path program 11 times [2018-10-27 04:45:55,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:55,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:55,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:55,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:55,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-10-27 04:45:55,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:55,906 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/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-10-27 04:45:55,913 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 04:46:25,437 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-10-27 04:46:25,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:46:25,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-10-27 04:46:25,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:25,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-10-27 04:46:25,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:46:25,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:46:25,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:46:25,630 INFO L87 Difference]: Start difference. First operand 245 states and 249 transitions. Second operand 13 states. [2018-10-27 04:46:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:25,682 INFO L93 Difference]: Finished difference Result 251 states and 255 transitions. [2018-10-27 04:46:25,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:46:25,683 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 224 [2018-10-27 04:46:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:25,684 INFO L225 Difference]: With dead ends: 251 [2018-10-27 04:46:25,684 INFO L226 Difference]: Without dead ends: 251 [2018-10-27 04:46:25,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:46:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-27 04:46:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-10-27 04:46:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-27 04:46:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 255 transitions. [2018-10-27 04:46:25,688 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 255 transitions. Word has length 224 [2018-10-27 04:46:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:25,688 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 255 transitions. [2018-10-27 04:46:25,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:46:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 255 transitions. [2018-10-27 04:46:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 04:46:25,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:25,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:25,693 INFO L424 AbstractCegarLoop]: === Iteration 29 === [getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-10-27 04:46:25,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash -489349428, now seen corresponding path program 12 times [2018-10-27 04:46:25,693 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:25,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:25,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:25,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:46:25,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 04:46:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 04:46:26,180 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-27 04:46:26,217 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,218 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,218 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,218 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,218 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,218 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,219 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,219 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,219 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,219 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,219 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,219 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,220 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,220 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,220 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,220 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,220 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,220 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,221 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,228 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,228 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,228 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,228 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,229 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:46:26 BoogieIcfgContainer [2018-10-27 04:46:26,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:46:26,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 04:46:26,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 04:46:26,264 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 04:46:26,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:24" (3/4) ... [2018-10-27 04:46:26,268 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-27 04:46:26,284 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,286 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,286 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,286 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,288 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,288 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,288 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,288 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,288 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,288 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,289 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,289 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,289 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,289 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,289 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,289 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,289 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,289 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,290 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,290 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 114 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,290 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,290 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,290 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 103 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,290 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 113 could not be translated for associated CType ARRAY#_10_~INT# [2018-10-27 04:46:26,365 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_640a5335-1463-4c98-90b8-33fd06f08867/bin-2019/uautomizer/witness.graphml [2018-10-27 04:46:26,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 04:46:26,369 INFO L168 Benchmark]: Toolchain (without parser) took 63484.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.7 MB). Free memory was 960.3 MB in the beginning and 1.2 GB in the end (delta: -245.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-10-27 04:46:26,371 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:46:26,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.28 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:46:26,371 INFO L168 Benchmark]: Boogie Preprocessor took 64.01 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:46:26,372 INFO L168 Benchmark]: RCFGBuilder took 934.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2018-10-27 04:46:26,373 INFO L168 Benchmark]: TraceAbstraction took 62174.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 128.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.0 MB). Peak memory consumption was 381.8 MB. Max. memory is 11.5 GB. [2018-10-27 04:46:26,373 INFO L168 Benchmark]: Witness Printer took 104.52 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2018-10-27 04:46:26,375 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 202.28 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.01 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 934.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 62174.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 128.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.0 MB). Peak memory consumption was 381.8 MB. Max. memory is 11.5 GB. * Witness Printer took 104.52 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 111 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 102 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 114 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 111 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 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 103 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 113 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 102 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 111 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 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 111 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 113 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 115 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 115 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 111 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 102 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 113 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 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 111 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 102 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 114 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 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 111 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 111 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 115 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 113 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" VAL ["%d\n"={112:0}, \old("%d\n")=110, \old("%d\n")=107, \old(array)=null, \old(array)=null, \old(numbers2)=null, \old(numbers2)=null, \old(numbers4)=null, \old(numbers4)=null, array={114:115}, numbers2={103:111}, numbers4={102:113}] [L6] FCALL static int array[10]; VAL ["%d\n"={112:0}, \old("%d\n")=107, \old("%d\n")=110, \old(array)=null, \old(array)=null, \old(numbers2)=null, \old(numbers2)=null, \old(numbers4)=null, \old(numbers4)=null, array={106:0}, numbers2={103:111}, numbers4={102:113}] [L17] FCALL static int numbers2[10]; VAL ["%d\n"={112:0}, \old("%d\n")=107, \old("%d\n")=110, \old(array)=null, \old(array)=null, \old(numbers2)=null, \old(numbers2)=null, \old(numbers4)=null, \old(numbers4)=null, array={106:0}, numbers2={109:0}, numbers4={102:113}] [L36] FCALL static int numbers4[10]; VAL ["%d\n"={112:0}, \old("%d\n")=110, \old("%d\n")=107, \old(array)=null, \old(array)=null, \old(numbers2)=null, \old(numbers2)=null, \old(numbers4)=null, \old(numbers4)=null, array={106:0}, numbers2={109:0}, numbers4={108:0}] [L45] CALL getNumbers4() VAL ["%d\n"={112:0}, array={106:0}, numbers2={109:0}, numbers4={108:0}] [L35] CALL, EXPR getNumbers3() VAL ["%d\n"={112:0}, array={106:0}, numbers2={109:0}, numbers4={108:0}] [L25] CALL, EXPR getNumbers2() VAL ["%d\n"={112:0}, array={106:0}, numbers2={109:0}, numbers4={108:0}] [L16] CALL, EXPR getNumbers() VAL ["%d\n"={112:0}, array={106:0}, numbers2={109:0}, numbers4={108:0}] [L8] int i = 0; VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers2={109:0}, numbers4={108:0}] [L8] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers2={109:0}, numbers4={108:0}] [L9] FCALL array[i] = i VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers2={109:0}, numbers4={108:0}] [L8] ++i VAL ["%d\n"={112:0}, array={106:0}, i=10, numbers2={109:0}, numbers4={108:0}] [L8] COND FALSE !(i < 10) VAL ["%d\n"={112:0}, array={106:0}, i=10, numbers2={109:0}, numbers4={108:0}] [L12] RET return array; VAL ["%d\n"={112:0}, \result={106:0}, array={106:0}, i=10, numbers2={109:0}, numbers4={108:0}] [L16] EXPR getNumbers() VAL ["%d\n"={112:0}, array={106:0}, getNumbers()={106:0}, numbers2={109:0}, numbers4={108:0}] [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=0] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=0] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=1] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=1] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=2] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=2] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=3] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=3] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=4] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=4] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=5] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=5] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=6] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=6] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=7] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=7] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=8] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=8] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L19] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=9] [L19] FCALL numbers2[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={106:0}, numbers2={109:0}, numbers4={108:0}, numbers[i]=9] [L18] ++i VAL ["%d\n"={112:0}, array={106:0}, i=10, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L18] COND FALSE !(i < 10) VAL ["%d\n"={112:0}, array={106:0}, i=10, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L21] RET return numbers2; VAL ["%d\n"={112:0}, \result={109:0}, array={106:0}, i=10, numbers={106:0}, numbers2={109:0}, numbers4={108:0}] [L25] EXPR getNumbers2() VAL ["%d\n"={112:0}, array={106:0}, getNumbers2()={109:0}, numbers2={109:0}, numbers4={108:0}] [L25] int* numbers = getNumbers2(); [L26] FCALL int numbers3[10]; VAL ["%d\n"={112:0}, array={106:0}, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] int i = 0; VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=0] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=0] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=1] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=1, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=1] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=2] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=2, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=2] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=3] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=3, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=3] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=4] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=4, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=4] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=5] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=5, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=5] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=6] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=6, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=6] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=7] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=7, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=7] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=8] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=8, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=8] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L28] EXPR, FCALL numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=9] [L28] FCALL numbers3[i] = numbers[i] VAL ["%d\n"={112:0}, array={106:0}, i=9, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}, numbers[i]=9] [L27] ++i VAL ["%d\n"={112:0}, array={106:0}, i=10, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L27] COND FALSE !(i < 10) VAL ["%d\n"={112:0}, array={106:0}, i=10, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L31] return numbers3; VAL ["%d\n"={112:0}, \result={104:0}, array={106:0}, i=10, numbers={109:0}, numbers2={109:0}, numbers3={104:0}, numbers4={108:0}] [L31] RET return numbers3; VAL ["%d\n"={112:0}, \result={104:0}, array={106:0}, i=10, numbers={109:0}, numbers2={109:0}, numbers4={108:0}] [L35] EXPR getNumbers3() VAL ["%d\n"={112:0}, array={106:0}, getNumbers3()={104:0}, numbers2={109:0}, numbers4={108:0}] [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={104:0}, numbers2={109:0}, numbers4={108:0}] [L37] COND TRUE i < 10 VAL ["%d\n"={112:0}, array={106:0}, i=0, numbers={104:0}, numbers2={109:0}, numbers4={108:0}] [L38] FCALL numbers[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 114 locations, 17 error locations. UNSAFE Result, 62.1s OverallTime, 29 OverallIterations, 11 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2582 SDtfs, 1765 SDslu, 13773 SDs, 0 SdLazy, 3495 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3368 GetRequests, 3073 SyntacticMatches, 6 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=28, 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, 28 MinimizatonAttempts, 83 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 43.1s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 6739 NumberOfCodeBlocks, 6391 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 6458 ConstructedInterpolants, 252 QuantifiedInterpolants, 2133416 SizeOfPredicates, 50 NumberOfNonLiveVariables, 7641 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 51 InterpolantComputations, 11 PerfectInterpolantSequences, 9715/13159 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...