./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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 b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 11:33:22,376 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 11:33:22,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 11:33:22,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 11:33:22,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 11:33:22,384 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 11:33:22,385 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 11:33:22,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 11:33:22,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 11:33:22,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 11:33:22,388 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 11:33:22,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 11:33:22,388 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 11:33:22,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 11:33:22,389 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 11:33:22,390 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 11:33:22,390 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 11:33:22,391 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 11:33:22,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 11:33:22,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 11:33:22,393 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 11:33:22,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 11:33:22,395 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 11:33:22,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 11:33:22,395 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 11:33:22,396 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 11:33:22,397 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 11:33:22,397 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 11:33:22,397 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 11:33:22,398 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 11:33:22,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 11:33:22,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 11:33:22,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 11:33:22,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 11:33:22,399 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 11:33:22,400 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 11:33:22,400 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-08 11:33:22,407 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 11:33:22,407 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 11:33:22,408 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 11:33:22,408 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 11:33:22,408 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 11:33:22,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 11:33:22,409 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 11:33:22,409 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 11:33:22,409 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 11:33:22,409 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 11:33:22,409 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 11:33:22,409 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 11:33:22,409 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 11:33:22,410 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 11:33:22,410 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 11:33:22,410 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 11:33:22,410 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 11:33:22,410 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 11:33:22,410 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 11:33:22,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 11:33:22,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 11:33:22,411 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 11:33:22,411 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 11:33:22,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 11:33:22,411 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 11:33:22,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 11:33:22,411 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 11:33:22,411 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 11:33:22,411 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_b5e00448-0c41-4747-a217-fcbec07f6935/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 -> b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 [2018-12-08 11:33:22,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 11:33:22,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 11:33:22,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 11:33:22,443 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 11:33:22,443 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 11:33:22,444 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-12-08 11:33:22,482 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/bin-2019/uautomizer/data/161cbfac8/e24f4d8f5c6e444f893e9e49ca2fbf79/FLAG411d95320 [2018-12-08 11:33:22,913 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 11:33:22,914 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-12-08 11:33:22,917 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/bin-2019/uautomizer/data/161cbfac8/e24f4d8f5c6e444f893e9e49ca2fbf79/FLAG411d95320 [2018-12-08 11:33:22,926 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/bin-2019/uautomizer/data/161cbfac8/e24f4d8f5c6e444f893e9e49ca2fbf79 [2018-12-08 11:33:22,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 11:33:22,929 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 11:33:22,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 11:33:22,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 11:33:22,932 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 11:33:22,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:33:22" (1/1) ... [2018-12-08 11:33:22,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4969d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:22, skipping insertion in model container [2018-12-08 11:33:22,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:33:22" (1/1) ... [2018-12-08 11:33:22,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 11:33:22,948 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 11:33:23,049 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:33:23,057 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 11:33:23,069 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:33:23,081 INFO L195 MainTranslator]: Completed translation [2018-12-08 11:33:23,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:23 WrapperNode [2018-12-08 11:33:23,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 11:33:23,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 11:33:23,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 11:33:23,082 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 11:33:23,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:23" (1/1) ... [2018-12-08 11:33:23,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:23" (1/1) ... [2018-12-08 11:33:23,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:23" (1/1) ... [2018-12-08 11:33:23,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:23" (1/1) ... [2018-12-08 11:33:23,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:23" (1/1) ... [2018-12-08 11:33:23,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:23" (1/1) ... [2018-12-08 11:33:23,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:23" (1/1) ... [2018-12-08 11:33:23,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 11:33:23,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 11:33:23,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 11:33:23,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 11:33:23,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:23,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 11:33:23,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 11:33:23,166 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-12-08 11:33:23,166 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-12-08 11:33:23,166 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-12-08 11:33:23,166 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-12-08 11:33:23,166 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 11:33:23,166 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-12-08 11:33:23,166 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-12-08 11:33:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 11:33:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-12-08 11:33:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 11:33:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-12-08 11:33:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-12-08 11:33:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 11:33:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 11:33:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 11:33:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 11:33:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 11:33:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 11:33:23,355 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 11:33:23,355 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-08 11:33:23,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:33:23 BoogieIcfgContainer [2018-12-08 11:33:23,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 11:33:23,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 11:33:23,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 11:33:23,358 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 11:33:23,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 11:33:22" (1/3) ... [2018-12-08 11:33:23,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46139aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:33:23, skipping insertion in model container [2018-12-08 11:33:23,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:23" (2/3) ... [2018-12-08 11:33:23,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46139aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:33:23, skipping insertion in model container [2018-12-08 11:33:23,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:33:23" (3/3) ... [2018-12-08 11:33:23,360 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_true-valid-memsafety.c [2018-12-08 11:33:23,366 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 11:33:23,370 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-12-08 11:33:23,380 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-12-08 11:33:23,395 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 11:33:23,395 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 11:33:23,395 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 11:33:23,395 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 11:33:23,395 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 11:33:23,395 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 11:33:23,396 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 11:33:23,396 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 11:33:23,396 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 11:33:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-12-08 11:33:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 11:33:23,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:23,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:23,413 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:23,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:23,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2018-12-08 11:33:23,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:23,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:23,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:23,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:23,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:23,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:33:23,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 11:33:23,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:33:23,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:33:23,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:33:23,555 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2018-12-08 11:33:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:23,596 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-12-08 11:33:23,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:33:23,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-08 11:33:23,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:23,602 INFO L225 Difference]: With dead ends: 68 [2018-12-08 11:33:23,602 INFO L226 Difference]: Without dead ends: 63 [2018-12-08 11:33:23,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:33:23,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-08 11:33:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-08 11:33:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-08 11:33:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-12-08 11:33:23,625 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 12 [2018-12-08 11:33:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:23,625 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-12-08 11:33:23,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:33:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-12-08 11:33:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 11:33:23,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:23,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:23,626 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:23,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:23,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2018-12-08 11:33:23,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:23,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:23,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:23,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:23,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:23,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:33:23,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 11:33:23,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:33:23,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:33:23,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:33:23,702 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2018-12-08 11:33:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:23,766 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-12-08 11:33:23,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 11:33:23,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-08 11:33:23,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:23,768 INFO L225 Difference]: With dead ends: 66 [2018-12-08 11:33:23,768 INFO L226 Difference]: Without dead ends: 66 [2018-12-08 11:33:23,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:33:23,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-08 11:33:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-12-08 11:33:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-08 11:33:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-12-08 11:33:23,774 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2018-12-08 11:33:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:23,775 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-12-08 11:33:23,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:33:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-12-08 11:33:23,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 11:33:23,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:23,775 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:23,776 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:23,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:23,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2018-12-08 11:33:23,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:23,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:23,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:23,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:23,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:23,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:23,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:23,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-12-08 11:33:23,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:23,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2018-12-08 11:33:23,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:23,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:23,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:23,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2018-12-08 11:33:24,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2018-12-08 11:33:24,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2018-12-08 11:33:24,146 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2018-12-08 11:33:24,186 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,224 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:33:24,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-08 11:33:24,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-08 11:33:24,308 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,331 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2018-12-08 11:33:24,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2018-12-08 11:33:24,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-08 11:33:24,430 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,440 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,456 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,472 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-08 11:33:24,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 11:33:24,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-08 11:33:24,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-08 11:33:24,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:24,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2018-12-08 11:33:24,523 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,537 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,545 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,551 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,556 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:24,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 11:33:24,575 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-08 11:33:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:24,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:33:24,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-08 11:33:24,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 11:33:24,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 11:33:24,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:33:24,670 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 8 states. [2018-12-08 11:33:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:24,803 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-08 11:33:24,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:33:24,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-08 11:33:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:24,803 INFO L225 Difference]: With dead ends: 69 [2018-12-08 11:33:24,803 INFO L226 Difference]: Without dead ends: 69 [2018-12-08 11:33:24,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:33:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-08 11:33:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-12-08 11:33:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-08 11:33:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-12-08 11:33:24,807 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2018-12-08 11:33:24,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:24,807 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-12-08 11:33:24,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 11:33:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-12-08 11:33:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 11:33:24,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:24,808 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:24,808 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:24,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:24,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1917592711, now seen corresponding path program 2 times [2018-12-08 11:33:24,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:24,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:24,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:24,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:24,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:24,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:33:24,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:33:24,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 11:33:24,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 11:33:24,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:33:24,977 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 8 states. [2018-12-08 11:33:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:25,028 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-12-08 11:33:25,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:33:25,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-08 11:33:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:25,029 INFO L225 Difference]: With dead ends: 68 [2018-12-08 11:33:25,029 INFO L226 Difference]: Without dead ends: 68 [2018-12-08 11:33:25,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:33:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-08 11:33:25,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-08 11:33:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-08 11:33:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-12-08 11:33:25,033 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 18 [2018-12-08 11:33:25,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:25,033 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-12-08 11:33:25,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 11:33:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-12-08 11:33:25,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 11:33:25,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:25,034 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:25,034 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:25,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:25,034 INFO L82 PathProgramCache]: Analyzing trace with hash 421781908, now seen corresponding path program 1 times [2018-12-08 11:33:25,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:25,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:25,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:25,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:33:25,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 11:33:25,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:33:25,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:33:25,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:33:25,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:33:25,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:33:25,068 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-12-08 11:33:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:25,135 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-08 11:33:25,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 11:33:25,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-08 11:33:25,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:25,135 INFO L225 Difference]: With dead ends: 65 [2018-12-08 11:33:25,136 INFO L226 Difference]: Without dead ends: 65 [2018-12-08 11:33:25,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:33:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-08 11:33:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-08 11:33:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-08 11:33:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-12-08 11:33:25,138 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 23 [2018-12-08 11:33:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:25,139 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-12-08 11:33:25,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:33:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-12-08 11:33:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 11:33:25,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:25,139 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:25,139 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:25,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:25,139 INFO L82 PathProgramCache]: Analyzing trace with hash 421781909, now seen corresponding path program 1 times [2018-12-08 11:33:25,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:25,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:25,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:25,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:25,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:25,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:25,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:25,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:25,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:25,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:33:25,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-08 11:33:25,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:33:25,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:33:25,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:33:25,218 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-12-08 11:33:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:25,234 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-12-08 11:33:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:33:25,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-08 11:33:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:25,235 INFO L225 Difference]: With dead ends: 70 [2018-12-08 11:33:25,235 INFO L226 Difference]: Without dead ends: 70 [2018-12-08 11:33:25,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:33:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-08 11:33:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-08 11:33:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-08 11:33:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-12-08 11:33:25,240 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2018-12-08 11:33:25,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:25,240 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-12-08 11:33:25,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:33:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-12-08 11:33:25,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 11:33:25,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:25,241 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:25,241 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:25,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:25,241 INFO L82 PathProgramCache]: Analyzing trace with hash -16477362, now seen corresponding path program 2 times [2018-12-08 11:33:25,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:25,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:25,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:25,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:25,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:25,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:25,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:25,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:33:25,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 11:33:25,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:33:25,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:25,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-12-08 11:33:25,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2018-12-08 11:33:25,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2018-12-08 11:33:25,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2018-12-08 11:33:25,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-12-08 11:33:25,518 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 53 [2018-12-08 11:33:25,552 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,570 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-08 11:33:25,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-08 11:33:25,622 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,632 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2018-12-08 11:33:25,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2018-12-08 11:33:25,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-08 11:33:25,717 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,726 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,734 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,749 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-08 11:33:25,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 11:33:25,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-08 11:33:25,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-08 11:33:25,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:25,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2018-12-08 11:33:25,783 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,795 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,805 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,810 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,814 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:25,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 11:33:25,829 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-08 11:33:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 11:33:25,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:33:25,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2018-12-08 11:33:25,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 11:33:25,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 11:33:25,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-08 11:33:25,954 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 11 states. [2018-12-08 11:33:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:26,260 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-08 11:33:26,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 11:33:26,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-12-08 11:33:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:26,261 INFO L225 Difference]: With dead ends: 73 [2018-12-08 11:33:26,261 INFO L226 Difference]: Without dead ends: 73 [2018-12-08 11:33:26,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-12-08 11:33:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-08 11:33:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-12-08 11:33:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-08 11:33:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-12-08 11:33:26,265 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 26 [2018-12-08 11:33:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:26,265 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-12-08 11:33:26,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 11:33:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-12-08 11:33:26,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 11:33:26,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:26,266 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:26,267 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:26,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:26,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1612905533, now seen corresponding path program 1 times [2018-12-08 11:33:26,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:26,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:26,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:26,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:33:26,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:26,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:26,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:26,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:26,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:26,343 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:26,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:33:26,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-08 11:33:26,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 11:33:26,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 11:33:26,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:33:26,359 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 8 states. [2018-12-08 11:33:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:26,377 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-12-08 11:33:26,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:33:26,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-08 11:33:26,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:26,378 INFO L225 Difference]: With dead ends: 76 [2018-12-08 11:33:26,378 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 11:33:26,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:33:26,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 11:33:26,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-12-08 11:33:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-08 11:33:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-12-08 11:33:26,382 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 30 [2018-12-08 11:33:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:26,382 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-12-08 11:33:26,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 11:33:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-12-08 11:33:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 11:33:26,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:26,383 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:26,383 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:26,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:26,384 INFO L82 PathProgramCache]: Analyzing trace with hash 532455402, now seen corresponding path program 2 times [2018-12-08 11:33:26,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:26,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:26,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:26,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:26,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:26,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:26,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:26,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:33:26,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 11:33:26,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:33:26,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:26,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 74 [2018-12-08 11:33:26,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2018-12-08 11:33:26,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-12-08 11:33:26,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 71 [2018-12-08 11:33:26,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2018-12-08 11:33:26,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-12-08 11:33:26,624 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:26,640 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:26,653 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:26,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:26,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 80 [2018-12-08 11:33:26,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 75 [2018-12-08 11:33:26,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2018-12-08 11:33:26,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-12-08 11:33:26,825 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:26,841 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:26,861 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:26,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 85 [2018-12-08 11:33:26,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:26,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 85 [2018-12-08 11:33:26,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-12-08 11:33:26,996 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:27,012 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:27,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 99 [2018-12-08 11:33:27,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2018-12-08 11:33:27,059 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:27,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:27,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 97 [2018-12-08 11:33:27,126 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-08 11:33:27,199 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 11:33:27,267 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:33:27,347 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-08 11:33:27,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 11:33:27,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 11:33:27,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-12-08 11:33:27,664 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2018-12-08 11:33:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-08 11:33:27,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:33:27,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2018-12-08 11:33:27,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 11:33:27,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 11:33:27,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:33:27,878 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 9 states. [2018-12-08 11:33:28,007 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-08 11:33:28,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:28,317 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-12-08 11:33:28,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 11:33:28,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-08 11:33:28,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:28,318 INFO L225 Difference]: With dead ends: 78 [2018-12-08 11:33:28,318 INFO L226 Difference]: Without dead ends: 78 [2018-12-08 11:33:28,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-12-08 11:33:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-08 11:33:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-12-08 11:33:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-08 11:33:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-12-08 11:33:28,321 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 33 [2018-12-08 11:33:28,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:28,321 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-12-08 11:33:28,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 11:33:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-12-08 11:33:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 11:33:28,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:28,322 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:28,322 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:28,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:28,322 INFO L82 PathProgramCache]: Analyzing trace with hash -428261788, now seen corresponding path program 1 times [2018-12-08 11:33:28,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:28,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:28,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:28,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:33:28,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:28,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:28,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:28,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:28,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:28,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:33:28,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-08 11:33:28,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 11:33:28,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 11:33:28,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-08 11:33:28,407 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 10 states. [2018-12-08 11:33:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:28,433 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-12-08 11:33:28,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 11:33:28,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-08 11:33:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:28,434 INFO L225 Difference]: With dead ends: 81 [2018-12-08 11:33:28,434 INFO L226 Difference]: Without dead ends: 81 [2018-12-08 11:33:28,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 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-12-08 11:33:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-08 11:33:28,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-12-08 11:33:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-08 11:33:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-12-08 11:33:28,437 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 36 [2018-12-08 11:33:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:28,437 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-12-08 11:33:28,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 11:33:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-12-08 11:33:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 11:33:28,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:28,438 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:28,438 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:28,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:28,439 INFO L82 PathProgramCache]: Analyzing trace with hash 507961675, now seen corresponding path program 2 times [2018-12-08 11:33:28,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:28,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:28,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:28,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:28,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:33:28,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:28,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:28,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:33:28,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 11:33:28,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:33:28,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:28,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-08 11:33:28,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 11:33:28,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-08 11:33:28,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-08 11:33:28,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2018-12-08 11:33:28,528 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,543 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-12-08 11:33:28,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2018-12-08 11:33:28,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2018-12-08 11:33:28,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2018-12-08 11:33:28,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-12-08 11:33:28,749 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2018-12-08 11:33:28,782 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,805 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:33:28,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-08 11:33:28,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-08 11:33:28,856 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,865 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,874 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2018-12-08 11:33:28,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2018-12-08 11:33:28,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:28,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-08 11:33:28,934 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,941 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,946 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,956 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,961 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:28,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 11:33:28,972 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-08 11:33:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-08 11:33:29,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:33:29,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2018-12-08 11:33:29,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 11:33:29,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 11:33:29,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-08 11:33:29,058 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 13 states. [2018-12-08 11:33:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:29,249 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-08 11:33:29,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 11:33:29,249 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-12-08 11:33:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:29,250 INFO L225 Difference]: With dead ends: 83 [2018-12-08 11:33:29,250 INFO L226 Difference]: Without dead ends: 83 [2018-12-08 11:33:29,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2018-12-08 11:33:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-08 11:33:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-12-08 11:33:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-08 11:33:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-12-08 11:33:29,252 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 39 [2018-12-08 11:33:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:29,252 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-12-08 11:33:29,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 11:33:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-12-08 11:33:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 11:33:29,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:29,253 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:29,253 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:29,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:29,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1242834180, now seen corresponding path program 1 times [2018-12-08 11:33:29,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:29,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:29,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:33:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-08 11:33:29,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:33:29,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:33:29,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:33:29,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:33:29,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:33:29,279 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 6 states. [2018-12-08 11:33:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:29,329 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-12-08 11:33:29,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 11:33:29,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-12-08 11:33:29,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:29,330 INFO L225 Difference]: With dead ends: 80 [2018-12-08 11:33:29,330 INFO L226 Difference]: Without dead ends: 80 [2018-12-08 11:33:29,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:33:29,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-08 11:33:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-08 11:33:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-08 11:33:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-12-08 11:33:29,332 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 51 [2018-12-08 11:33:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:29,332 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-12-08 11:33:29,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:33:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-12-08 11:33:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 11:33:29,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:29,333 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:29,333 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:29,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:29,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1242834181, now seen corresponding path program 1 times [2018-12-08 11:33:29,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:29,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:29,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:29,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:29,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 11:33:29,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:29,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:29,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:29,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 11:33:29,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:33:29,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-08 11:33:29,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 11:33:29,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 11:33:29,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-08 11:33:29,437 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 12 states. [2018-12-08 11:33:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:29,462 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-12-08 11:33:29,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 11:33:29,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-12-08 11:33:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:29,463 INFO L225 Difference]: With dead ends: 85 [2018-12-08 11:33:29,463 INFO L226 Difference]: Without dead ends: 85 [2018-12-08 11:33:29,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-08 11:33:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-08 11:33:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-12-08 11:33:29,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-08 11:33:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-12-08 11:33:29,466 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 51 [2018-12-08 11:33:29,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:29,466 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-12-08 11:33:29,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 11:33:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-12-08 11:33:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 11:33:29,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:29,467 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:29,467 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:29,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:29,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1213368514, now seen corresponding path program 2 times [2018-12-08 11:33:29,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:29,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:29,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:29,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:29,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 11:33:29,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:29,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:29,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:33:29,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 11:33:29,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:33:29,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:29,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-08 11:33:29,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 11:33:29,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-08 11:33:29,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-08 11:33:29,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2018-12-08 11:33:29,584 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:29,619 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:29,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:29,636 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:29,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:29,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-12-08 11:33:29,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2018-12-08 11:33:29,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2018-12-08 11:33:29,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 76 [2018-12-08 11:33:29,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2018-12-08 11:33:29,862 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:29,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-12-08 11:33:29,893 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:29,910 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:29,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-08 11:33:29,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-08 11:33:29,955 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:29,963 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:29,973 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:29,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:29,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2018-12-08 11:33:30,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2018-12-08 11:33:30,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-08 11:33:30,032 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:30,040 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:30,044 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:30,052 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:30,057 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:30,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 11:33:30,067 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-08 11:33:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-08 11:33:30,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:33:30,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2018-12-08 11:33:30,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 11:33:30,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 11:33:30,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-12-08 11:33:30,236 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 17 states. [2018-12-08 11:33:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:30,634 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-12-08 11:33:30,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 11:33:30,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-12-08 11:33:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:30,635 INFO L225 Difference]: With dead ends: 86 [2018-12-08 11:33:30,635 INFO L226 Difference]: Without dead ends: 86 [2018-12-08 11:33:30,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2018-12-08 11:33:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-08 11:33:30,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-08 11:33:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-08 11:33:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-12-08 11:33:30,638 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 54 [2018-12-08 11:33:30,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:30,639 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-12-08 11:33:30,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 11:33:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-12-08 11:33:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 11:33:30,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:30,639 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:30,640 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:30,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1111163333, now seen corresponding path program 1 times [2018-12-08 11:33:30,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:30,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:30,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:30,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:33:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-08 11:33:30,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:30,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:30,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:30,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-08 11:33:30,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:33:30,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-08 11:33:30,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:33:30,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:33:30,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:33:30,733 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 5 states. [2018-12-08 11:33:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:30,742 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-12-08 11:33:30,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 11:33:30,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-08 11:33:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:30,742 INFO L225 Difference]: With dead ends: 95 [2018-12-08 11:33:30,742 INFO L226 Difference]: Without dead ends: 95 [2018-12-08 11:33:30,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:33:30,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-08 11:33:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-12-08 11:33:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 11:33:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-12-08 11:33:30,744 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 58 [2018-12-08 11:33:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:30,744 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-12-08 11:33:30,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:33:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-12-08 11:33:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 11:33:30,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:30,745 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:30,745 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:30,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:30,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1242768695, now seen corresponding path program 2 times [2018-12-08 11:33:30,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:30,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:30,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:30,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:30,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-08 11:33:30,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:30,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:30,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:33:30,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 11:33:30,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:33:30,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:30,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 74 [2018-12-08 11:33:30,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2018-12-08 11:33:30,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 80 [2018-12-08 11:33:30,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:30,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 75 [2018-12-08 11:33:31,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2018-12-08 11:33:31,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-12-08 11:33:31,029 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:31,051 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:31,067 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:31,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 85 [2018-12-08 11:33:31,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 85 [2018-12-08 11:33:31,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-12-08 11:33:31,213 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:31,229 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:31,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 99 [2018-12-08 11:33:31,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2018-12-08 11:33:31,272 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:31,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 97 [2018-12-08 11:33:31,330 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-08 11:33:31,400 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 11:33:31,465 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:33:31,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-08 11:33:31,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-12-08 11:33:31,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 71 [2018-12-08 11:33:31,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:31,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2018-12-08 11:33:31,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-12-08 11:33:31,700 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:31,714 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:31,726 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:31,740 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:31,829 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 11:33:31,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 11:33:32,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-12-08 11:33:32,020 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2018-12-08 11:33:34,050 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 202 DAG size of output: 112 [2018-12-08 11:33:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-08 11:33:34,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:33:34,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-12-08 11:33:34,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:33:34,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:33:34,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:33:34,282 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 6 states. [2018-12-08 11:33:36,391 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 115 [2018-12-08 11:33:36,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:36,474 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-12-08 11:33:36,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 11:33:36,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-08 11:33:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:36,474 INFO L225 Difference]: With dead ends: 99 [2018-12-08 11:33:36,474 INFO L226 Difference]: Without dead ends: 99 [2018-12-08 11:33:36,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:33:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-08 11:33:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-12-08 11:33:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-08 11:33:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-12-08 11:33:36,477 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 63 [2018-12-08 11:33:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:36,477 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-12-08 11:33:36,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:33:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-12-08 11:33:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 11:33:36,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:36,478 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:36,478 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:36,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:36,478 INFO L82 PathProgramCache]: Analyzing trace with hash 446605052, now seen corresponding path program 1 times [2018-12-08 11:33:36,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:36,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:36,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:36,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:33:36,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-08 11:33:36,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:36,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:33:36,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:36,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-08 11:33:36,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:33:36,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-08 11:33:36,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:33:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:33:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:33:36,560 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 7 states. [2018-12-08 11:33:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:36,583 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-12-08 11:33:36,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 11:33:36,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-12-08 11:33:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:36,583 INFO L225 Difference]: With dead ends: 104 [2018-12-08 11:33:36,583 INFO L226 Difference]: Without dead ends: 104 [2018-12-08 11:33:36,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:33:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-08 11:33:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2018-12-08 11:33:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-08 11:33:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-12-08 11:33:36,586 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 68 [2018-12-08 11:33:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:36,586 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-12-08 11:33:36,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:33:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-12-08 11:33:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 11:33:36,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:36,587 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:36,587 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:36,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:36,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1853794826, now seen corresponding path program 2 times [2018-12-08 11:33:36,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:36,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:36,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:36,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:36,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-08 11:33:36,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:36,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:36,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:33:36,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 11:33:36,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:33:36,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:36,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-12-08 11:33:36,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2018-12-08 11:33:36,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2018-12-08 11:33:36,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 66 [2018-12-08 11:33:36,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-12-08 11:33:36,779 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:36,790 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:36,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 76 [2018-12-08 11:33:36,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2018-12-08 11:33:36,886 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:36,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:36,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2018-12-08 11:33:36,917 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:36,946 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:33:36,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:33:37,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2018-12-08 11:33:37,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2018-12-08 11:33:37,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-08 11:33:37,058 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,066 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,073 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,091 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-08 11:33:37,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 11:33:37,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-08 11:33:37,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-08 11:33:37,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 72 [2018-12-08 11:33:37,118 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,133 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,142 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,146 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,151 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 11:33:37,165 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-08 11:33:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-12-08 11:33:37,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:33:37,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2018-12-08 11:33:37,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 11:33:37,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 11:33:37,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-08 11:33:37,320 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 10 states. [2018-12-08 11:33:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:37,502 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-12-08 11:33:37,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 11:33:37,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-12-08 11:33:37,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:37,502 INFO L225 Difference]: With dead ends: 108 [2018-12-08 11:33:37,502 INFO L226 Difference]: Without dead ends: 108 [2018-12-08 11:33:37,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-12-08 11:33:37,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-08 11:33:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2018-12-08 11:33:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-08 11:33:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-12-08 11:33:37,504 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 73 [2018-12-08 11:33:37,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:37,505 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-12-08 11:33:37,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 11:33:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-12-08 11:33:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 11:33:37,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:37,505 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2018-12-08 11:33:37,505 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:37,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:37,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1594057848, now seen corresponding path program 1 times [2018-12-08 11:33:37,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:37,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:37,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:37,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:33:37,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-12-08 11:33:37,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:33:37,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:33:37,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:33:37,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:33:37,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:33:37,532 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 6 states. [2018-12-08 11:33:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:37,584 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-12-08 11:33:37,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 11:33:37,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-08 11:33:37,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:37,585 INFO L225 Difference]: With dead ends: 103 [2018-12-08 11:33:37,585 INFO L226 Difference]: Without dead ends: 103 [2018-12-08 11:33:37,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:33:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-08 11:33:37,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-08 11:33:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-08 11:33:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-12-08 11:33:37,587 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 87 [2018-12-08 11:33:37,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:37,587 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-12-08 11:33:37,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:33:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-12-08 11:33:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 11:33:37,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:37,587 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2018-12-08 11:33:37,587 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:37,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:37,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1594057847, now seen corresponding path program 1 times [2018-12-08 11:33:37,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:37,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:37,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 11:33:37,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:37,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:37,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:37,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 11:33:37,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:33:37,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-08 11:33:37,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 11:33:37,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 11:33:37,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:33:37,683 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 9 states. [2018-12-08 11:33:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:37,706 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-12-08 11:33:37,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:33:37,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-12-08 11:33:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:37,707 INFO L225 Difference]: With dead ends: 112 [2018-12-08 11:33:37,707 INFO L226 Difference]: Without dead ends: 112 [2018-12-08 11:33:37,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:33:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-08 11:33:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-12-08 11:33:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-08 11:33:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-12-08 11:33:37,709 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 87 [2018-12-08 11:33:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:37,709 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-12-08 11:33:37,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 11:33:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-12-08 11:33:37,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 11:33:37,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:37,710 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2018-12-08 11:33:37,710 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:37,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:37,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1854312005, now seen corresponding path program 2 times [2018-12-08 11:33:37,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:37,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:37,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:37,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:37,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 11:33:37,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:37,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:37,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:33:37,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 11:33:37,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:33:37,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:37,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-08 11:33:37,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 11:33:37,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-12-08 11:33:37,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 43 [2018-12-08 11:33:37,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 64 [2018-12-08 11:33:37,831 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,843 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,857 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-08 11:33:37,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 55 [2018-12-08 11:33:37,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-12-08 11:33:37,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-12-08 11:33:37,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-12-08 11:33:37,934 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,942 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,946 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:37,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 53 [2018-12-08 11:33:37,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:37,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 68 [2018-12-08 11:33:38,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 56 [2018-12-08 11:33:38,055 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:38,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2018-12-08 11:33:38,087 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:38,103 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:33:38,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 55 [2018-12-08 11:33:38,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2018-12-08 11:33:38,147 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:38,153 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:38,161 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:38,174 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:38,179 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:38,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 11:33:38,188 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:70, output treesize:45 [2018-12-08 11:33:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-12-08 11:33:38,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:33:38,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2018-12-08 11:33:38,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 11:33:38,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 11:33:38,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-12-08 11:33:38,344 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 14 states. [2018-12-08 11:33:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:38,685 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-12-08 11:33:38,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 11:33:38,685 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2018-12-08 11:33:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:38,686 INFO L225 Difference]: With dead ends: 117 [2018-12-08 11:33:38,686 INFO L226 Difference]: Without dead ends: 117 [2018-12-08 11:33:38,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2018-12-08 11:33:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-08 11:33:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-12-08 11:33:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-08 11:33:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-12-08 11:33:38,688 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 92 [2018-12-08 11:33:38,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:38,688 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-12-08 11:33:38,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 11:33:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-12-08 11:33:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 11:33:38,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:38,689 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2018-12-08 11:33:38,689 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:38,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:38,689 INFO L82 PathProgramCache]: Analyzing trace with hash 196128295, now seen corresponding path program 1 times [2018-12-08 11:33:38,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:38,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:38,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:38,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:33:38,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 11:33:38,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:38,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:38,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:38,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 11:33:38,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:33:38,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-08 11:33:38,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 11:33:38,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 11:33:38,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-08 11:33:38,798 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 11 states. [2018-12-08 11:33:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:38,827 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2018-12-08 11:33:38,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 11:33:38,827 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-12-08 11:33:38,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:38,828 INFO L225 Difference]: With dead ends: 122 [2018-12-08 11:33:38,828 INFO L226 Difference]: Without dead ends: 122 [2018-12-08 11:33:38,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-08 11:33:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-08 11:33:38,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2018-12-08 11:33:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-08 11:33:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2018-12-08 11:33:38,830 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 98 [2018-12-08 11:33:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:38,830 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2018-12-08 11:33:38,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 11:33:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2018-12-08 11:33:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 11:33:38,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:38,831 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2018-12-08 11:33:38,831 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:38,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:38,832 INFO L82 PathProgramCache]: Analyzing trace with hash 916743349, now seen corresponding path program 2 times [2018-12-08 11:33:38,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:38,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:38,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:38,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:38,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 11:33:38,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:38,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:38,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:33:38,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 11:33:38,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:33:38,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:38,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-12-08 11:33:38,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2018-12-08 11:33:38,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-12-08 11:33:38,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:38,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2018-12-08 11:33:38,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2018-12-08 11:33:38,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2018-12-08 11:33:38,977 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:38,985 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 48 [2018-12-08 11:33:39,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 51 [2018-12-08 11:33:39,025 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-08 11:33:39,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 53 [2018-12-08 11:33:39,062 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,091 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 11:33:39,122 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:33:39,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-12-08 11:33:39,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-12-08 11:33:39,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-12-08 11:33:39,175 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,180 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,187 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-08 11:33:39,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2018-12-08 11:33:39,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-12-08 11:33:39,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-12-08 11:33:39,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-08 11:33:39,277 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,282 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,286 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,291 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 11:33:39,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 11:33:39,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-12-08 11:33:39,401 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:21, output treesize:165 [2018-12-08 11:33:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-12-08 11:33:39,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:33:39,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 12 [2018-12-08 11:33:39,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 11:33:39,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 11:33:39,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-12-08 11:33:39,481 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand 12 states. [2018-12-08 11:33:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:39,612 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-12-08 11:33:39,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 11:33:39,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-12-08 11:33:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:39,613 INFO L225 Difference]: With dead ends: 126 [2018-12-08 11:33:39,613 INFO L226 Difference]: Without dead ends: 126 [2018-12-08 11:33:39,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-12-08 11:33:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-08 11:33:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2018-12-08 11:33:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-08 11:33:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-12-08 11:33:39,615 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 103 [2018-12-08 11:33:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:39,615 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-12-08 11:33:39,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 11:33:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-12-08 11:33:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 11:33:39,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:39,615 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 11:33:39,616 INFO L423 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:39,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:39,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1877120744, now seen corresponding path program 1 times [2018-12-08 11:33:39,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:39,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:39,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:39,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:33:39,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 11:33:39,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:39,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:39,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:39,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-08 11:33:39,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:33:39,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-08 11:33:39,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 11:33:39,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 11:33:39,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-08 11:33:39,743 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 13 states. [2018-12-08 11:33:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:39,792 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-12-08 11:33:39,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 11:33:39,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2018-12-08 11:33:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:39,792 INFO L225 Difference]: With dead ends: 127 [2018-12-08 11:33:39,792 INFO L226 Difference]: Without dead ends: 127 [2018-12-08 11:33:39,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-08 11:33:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-08 11:33:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-08 11:33:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-08 11:33:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-12-08 11:33:39,794 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 108 [2018-12-08 11:33:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:39,794 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-12-08 11:33:39,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 11:33:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-12-08 11:33:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 11:33:39,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:39,795 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 11:33:39,795 INFO L423 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:39,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:39,795 INFO L82 PathProgramCache]: Analyzing trace with hash -184159242, now seen corresponding path program 2 times [2018-12-08 11:33:39,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:39,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:39,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:39,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:39,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-08 11:33:39,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:39,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:39,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:33:39,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 11:33:39,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:33:39,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:39,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-08 11:33:39,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 11:33:39,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-08 11:33:39,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2018-12-08 11:33:39,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 60 [2018-12-08 11:33:39,885 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,896 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,910 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:39,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-08 11:33:39,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 52 [2018-12-08 11:33:39,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:39,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 60 [2018-12-08 11:33:39,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 59 [2018-12-08 11:33:40,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-12-08 11:33:40,047 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-12-08 11:33:40,069 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,083 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 46 [2018-12-08 11:33:40,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-08 11:33:40,119 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,125 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,130 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-12-08 11:33:40,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2018-12-08 11:33:40,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-08 11:33:40,160 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,161 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,164 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,168 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,171 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 11:33:40,179 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2018-12-08 11:33:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-12-08 11:33:40,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:33:40,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-12-08 11:33:40,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:33:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:33:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:33:40,327 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 7 states. [2018-12-08 11:33:40,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:40,424 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-12-08 11:33:40,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:33:40,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-08 11:33:40,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:40,425 INFO L225 Difference]: With dead ends: 135 [2018-12-08 11:33:40,425 INFO L226 Difference]: Without dead ends: 135 [2018-12-08 11:33:40,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:33:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-08 11:33:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2018-12-08 11:33:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-08 11:33:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-12-08 11:33:40,427 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 113 [2018-12-08 11:33:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:40,427 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-12-08 11:33:40,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:33:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-12-08 11:33:40,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 11:33:40,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:40,428 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:40,428 INFO L423 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:40,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:40,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1533212022, now seen corresponding path program 1 times [2018-12-08 11:33:40,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:40,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:40,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:40,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:33:40,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-12-08 11:33:40,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:33:40,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:33:40,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:33:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:33:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:33:40,470 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 6 states. [2018-12-08 11:33:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:40,517 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-12-08 11:33:40,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 11:33:40,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-08 11:33:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:40,517 INFO L225 Difference]: With dead ends: 130 [2018-12-08 11:33:40,517 INFO L226 Difference]: Without dead ends: 130 [2018-12-08 11:33:40,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:33:40,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-08 11:33:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-08 11:33:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-08 11:33:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2018-12-08 11:33:40,519 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 127 [2018-12-08 11:33:40,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:40,519 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2018-12-08 11:33:40,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:33:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2018-12-08 11:33:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 11:33:40,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:40,520 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:40,520 INFO L423 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:40,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:40,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1533212021, now seen corresponding path program 1 times [2018-12-08 11:33:40,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:40,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:40,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:40,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:40,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-12-08 11:33:40,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:40,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:40,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:40,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-12-08 11:33:40,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:33:40,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-08 11:33:40,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:33:40,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:33:40,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:33:40,622 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand 6 states. [2018-12-08 11:33:40,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:40,643 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-12-08 11:33:40,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:33:40,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-08 11:33:40,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:40,643 INFO L225 Difference]: With dead ends: 139 [2018-12-08 11:33:40,643 INFO L226 Difference]: Without dead ends: 139 [2018-12-08 11:33:40,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:33:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-08 11:33:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-12-08 11:33:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-08 11:33:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-12-08 11:33:40,645 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 127 [2018-12-08 11:33:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:40,645 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-12-08 11:33:40,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:33:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-12-08 11:33:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 11:33:40,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:33:40,646 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:33:40,646 INFO L423 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-08 11:33:40,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:33:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash 82106357, now seen corresponding path program 2 times [2018-12-08 11:33:40,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:33:40,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:33:40,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:40,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:33:40,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:33:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:33:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-12-08 11:33:40,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:33:40,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/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-12-08 11:33:40,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:33:40,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 11:33:40,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:33:40,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:33:40,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-08 11:33:40,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 11:33:40,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-08 11:33:40,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2018-12-08 11:33:40,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 60 [2018-12-08 11:33:40,753 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,764 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,780 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-08 11:33:40,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 52 [2018-12-08 11:33:40,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 60 [2018-12-08 11:33:40,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 59 [2018-12-08 11:33:40,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-12-08 11:33:40,894 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-12-08 11:33:40,918 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,933 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:33:40,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 46 [2018-12-08 11:33:40,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-08 11:33:40,973 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,979 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,985 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:40,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:40,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-12-08 11:33:41,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2018-12-08 11:33:41,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:41,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:41,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:41,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:33:41,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-08 11:33:41,016 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 11:33:41,017 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:41,020 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:41,024 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:41,027 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:33:41,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 11:33:41,035 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2018-12-08 11:33:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2018-12-08 11:33:41,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 11:33:41,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2018-12-08 11:33:41,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 11:33:41,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 11:33:41,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-08 11:33:41,249 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 11 states. [2018-12-08 11:33:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:33:41,518 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2018-12-08 11:33:41,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 11:33:41,518 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2018-12-08 11:33:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:33:41,518 INFO L225 Difference]: With dead ends: 144 [2018-12-08 11:33:41,519 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 11:33:41,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-12-08 11:33:41,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 11:33:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 11:33:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 11:33:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 11:33:41,519 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2018-12-08 11:33:41,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:33:41,519 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 11:33:41,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 11:33:41,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 11:33:41,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 11:33:41,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 11:33:41 BoogieIcfgContainer [2018-12-08 11:33:41,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 11:33:41,523 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 11:33:41,523 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 11:33:41,523 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 11:33:41,524 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:33:23" (3/4) ... [2018-12-08 11:33:41,527 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 11:33:41,533 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 11:33:41,533 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2018-12-08 11:33:41,533 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2018-12-08 11:33:41,533 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2018-12-08 11:33:41,533 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 11:33:41,533 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2018-12-08 11:33:41,537 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-12-08 11:33:41,538 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-08 11:33:41,538 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-08 11:33:41,538 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 11:33:41,565 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b5e00448-0c41-4747-a217-fcbec07f6935/bin-2019/uautomizer/witness.graphml [2018-12-08 11:33:41,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 11:33:41,565 INFO L168 Benchmark]: Toolchain (without parser) took 18636.22 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 485.0 MB). Free memory was 961.4 MB in the beginning and 1.0 GB in the end (delta: -85.0 MB). Peak memory consumption was 400.0 MB. Max. memory is 11.5 GB. [2018-12-08 11:33:41,565 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:33:41,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.12 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 11:33:41,566 INFO L168 Benchmark]: Boogie Preprocessor took 52.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-12-08 11:33:41,566 INFO L168 Benchmark]: RCFGBuilder took 221.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-12-08 11:33:41,566 INFO L168 Benchmark]: TraceAbstraction took 18166.79 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.8 MB). Peak memory consumption was 404.6 MB. Max. memory is 11.5 GB. [2018-12-08 11:33:41,566 INFO L168 Benchmark]: Witness Printer took 41.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 218.9 kB). Peak memory consumption was 218.9 kB. Max. memory is 11.5 GB. [2018-12-08 11:33:41,567 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.12 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.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 52.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 221.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18166.79 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.8 MB). Peak memory consumption was 404.6 MB. Max. memory is 11.5 GB. * Witness Printer took 41.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 218.9 kB). Peak memory consumption was 218.9 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. SAFE Result, 18.1s OverallTime, 28 OverallIterations, 10 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1352 SDtfs, 1215 SDslu, 5695 SDs, 0 SdLazy, 2405 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1683 GetRequests, 1416 SyntacticMatches, 1 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=27, 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.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 58 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 3188 NumberOfCodeBlocks, 2696 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3139 ConstructedInterpolants, 620 QuantifiedInterpolants, 3837226 SizeOfPredicates, 62 NumberOfNonLiveVariables, 4532 ConjunctsInSsa, 245 ConjunctsInUnsatCore, 49 InterpolantComputations, 17 PerfectInterpolantSequences, 6125/7756 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...