./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/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.24-cad4683 [2019-11-16 00:16:40,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:16:40,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:16:40,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:16:40,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:16:40,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:16:40,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:16:40,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:16:40,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:16:40,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:16:40,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:16:40,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:16:40,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:16:40,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:16:40,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:16:40,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:16:40,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:16:40,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:16:40,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:16:40,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:16:40,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:16:40,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:16:40,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:16:40,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:16:40,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:16:40,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:16:40,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:16:40,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:16:40,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:16:40,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:16:40,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:16:40,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:16:40,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:16:40,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:16:40,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:16:40,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:16:40,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:16:40,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:16:40,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:16:40,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:16:40,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:16:40,874 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:16:40,886 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:16:40,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:16:40,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:16:40,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:16:40,888 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:16:40,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:16:40,888 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:16:40,889 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:16:40,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:16:40,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:16:40,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:16:40,889 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:16:40,890 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:16:40,890 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:16:40,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:16:40,890 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:16:40,890 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:16:40,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:16:40,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:16:40,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:16:40,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:16:40,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:16:40,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:16:40,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:16:40,892 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:16:40,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:16:40,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/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 [2019-11-16 00:16:40,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:16:40,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:16:40,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:16:40,940 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:16:40,941 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:16:40,941 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c [2019-11-16 00:16:41,008 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/data/39d429d04/a17aff79f0cc408c82aadb26a49c485e/FLAG2e64c74e8 [2019-11-16 00:16:41,423 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:16:41,425 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c [2019-11-16 00:16:41,431 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/data/39d429d04/a17aff79f0cc408c82aadb26a49c485e/FLAG2e64c74e8 [2019-11-16 00:16:41,446 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/data/39d429d04/a17aff79f0cc408c82aadb26a49c485e [2019-11-16 00:16:41,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:16:41,451 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:16:41,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:16:41,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:16:41,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:16:41,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:16:41" (1/1) ... [2019-11-16 00:16:41,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3615377b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:41, skipping insertion in model container [2019-11-16 00:16:41,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:16:41" (1/1) ... [2019-11-16 00:16:41,467 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:16:41,485 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:16:41,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:16:41,762 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:16:41,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:16:41,801 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:16:41,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:41 WrapperNode [2019-11-16 00:16:41,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:16:41,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:16:41,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:16:41,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:16:41,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:41" (1/1) ... [2019-11-16 00:16:41,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:41" (1/1) ... [2019-11-16 00:16:41,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:41" (1/1) ... [2019-11-16 00:16:41,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:41" (1/1) ... [2019-11-16 00:16:41,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:41" (1/1) ... [2019-11-16 00:16:41,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:41" (1/1) ... [2019-11-16 00:16:41,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:41" (1/1) ... [2019-11-16 00:16:41,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:16:41,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:16:41,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:16:41,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:16:41,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/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 [2019-11-16 00:16:41,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:16:41,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:16:41,896 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-11-16 00:16:41,896 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-11-16 00:16:41,897 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2019-11-16 00:16:41,897 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2019-11-16 00:16:41,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:16:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-11-16 00:16:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-11-16 00:16:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:16:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-11-16 00:16:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:16:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2019-11-16 00:16:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2019-11-16 00:16:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:16:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:16:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:16:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-16 00:16:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:16:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:16:42,421 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:16:42,422 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-16 00:16:42,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:16:42 BoogieIcfgContainer [2019-11-16 00:16:42,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:16:42,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:16:42,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:16:42,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:16:42,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:16:41" (1/3) ... [2019-11-16 00:16:42,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510152a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:16:42, skipping insertion in model container [2019-11-16 00:16:42,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:41" (2/3) ... [2019-11-16 00:16:42,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510152a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:16:42, skipping insertion in model container [2019-11-16 00:16:42,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:16:42" (3/3) ... [2019-11-16 00:16:42,432 INFO L109 eAbstractionObserver]: Analyzing ICFG getNumbers4-1.c [2019-11-16 00:16:42,441 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:16:42,450 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-11-16 00:16:42,460 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-11-16 00:16:42,475 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:16:42,475 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:16:42,475 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:16:42,475 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:16:42,476 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:16:42,476 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:16:42,476 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:16:42,476 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:16:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-11-16 00:16:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:16:42,502 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:42,503 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:42,507 INFO L410 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2019-11-16 00:16:42,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:42,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403952517] [2019-11-16 00:16:42,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:42,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:42,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:42,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403952517] [2019-11-16 00:16:42,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:42,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:16:42,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156271237] [2019-11-16 00:16:42,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:16:42,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:42,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:16:42,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:16:42,863 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-11-16 00:16:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:43,277 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2019-11-16 00:16:43,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:16:43,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:16:43,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:43,290 INFO L225 Difference]: With dead ends: 117 [2019-11-16 00:16:43,291 INFO L226 Difference]: Without dead ends: 109 [2019-11-16 00:16:43,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:16:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-16 00:16:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 63. [2019-11-16 00:16:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:16:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-16 00:16:43,343 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 12 [2019-11-16 00:16:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:43,344 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-16 00:16:43,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:16:43,344 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-16 00:16:43,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:16:43,345 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:43,345 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:43,345 INFO L410 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:43,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:43,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2019-11-16 00:16:43,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:43,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485399218] [2019-11-16 00:16:43,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:43,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:43,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:43,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485399218] [2019-11-16 00:16:43,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:43,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:16:43,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374901166] [2019-11-16 00:16:43,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:16:43,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:43,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:16:43,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:16:43,581 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 5 states. [2019-11-16 00:16:43,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:43,928 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-16 00:16:43,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:16:43,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-16 00:16:43,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:43,930 INFO L225 Difference]: With dead ends: 66 [2019-11-16 00:16:43,931 INFO L226 Difference]: Without dead ends: 66 [2019-11-16 00:16:43,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:16:43,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-16 00:16:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-11-16 00:16:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-16 00:16:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-16 00:16:43,947 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2019-11-16 00:16:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:43,948 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-16 00:16:43,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:16:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-16 00:16:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:16:43,950 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:43,951 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:43,951 INFO L410 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:43,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:43,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2019-11-16 00:16:43,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:43,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559883103] [2019-11-16 00:16:43,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:43,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:43,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:44,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559883103] [2019-11-16 00:16:44,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645853200] [2019-11-16 00:16:44,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:44,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:16:44,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:16:44,292 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_25|], 20=[|v_#valid_29|]} [2019-11-16 00:16:44,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-11-16 00:16:44,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:16:44,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:16:44,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:44,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:16:44,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 296 treesize of output 296 [2019-11-16 00:16:44,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:44,598 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:16:44,920 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 36 [2019-11-16 00:16:44,921 INFO L567 ElimStorePlain]: treesize reduction 4363, result has 1.2 percent of original size [2019-11-16 00:16:44,923 INFO L496 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. [2019-11-16 00:16:44,923 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-11-16 00:16:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:45,090 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:16:45,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-11-16 00:16:45,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747917332] [2019-11-16 00:16:45,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:16:45,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:45,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:16:45,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:16:45,095 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 9 states. [2019-11-16 00:16:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:45,600 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-16 00:16:45,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:16:45,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-11-16 00:16:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:45,602 INFO L225 Difference]: With dead ends: 69 [2019-11-16 00:16:45,602 INFO L226 Difference]: Without dead ends: 69 [2019-11-16 00:16:45,602 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:16:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-16 00:16:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-11-16 00:16:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-16 00:16:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-16 00:16:45,613 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-11-16 00:16:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:45,615 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-16 00:16:45,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:16:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-16 00:16:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:16:45,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:45,616 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:45,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:45,827 INFO L410 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:45,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:45,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1917592711, now seen corresponding path program 2 times [2019-11-16 00:16:45,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:45,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116810862] [2019-11-16 00:16:45,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:45,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:45,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:46,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116810862] [2019-11-16 00:16:46,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:46,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:16:46,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545004091] [2019-11-16 00:16:46,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:16:46,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:46,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:16:46,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:16:46,097 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 9 states. [2019-11-16 00:16:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:46,376 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-16 00:16:46,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:16:46,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-16 00:16:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:46,378 INFO L225 Difference]: With dead ends: 68 [2019-11-16 00:16:46,378 INFO L226 Difference]: Without dead ends: 68 [2019-11-16 00:16:46,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:16:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-16 00:16:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-16 00:16:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-16 00:16:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-16 00:16:46,383 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 18 [2019-11-16 00:16:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:46,384 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-16 00:16:46,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:16:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-16 00:16:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:16:46,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:46,384 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:46,385 INFO L410 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:46,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:46,385 INFO L82 PathProgramCache]: Analyzing trace with hash 421781908, now seen corresponding path program 1 times [2019-11-16 00:16:46,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:46,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662034163] [2019-11-16 00:16:46,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:46,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:46,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:16:46,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662034163] [2019-11-16 00:16:46,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:46,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:16:46,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174673034] [2019-11-16 00:16:46,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:16:46,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:46,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:16:46,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:16:46,504 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 8 states. [2019-11-16 00:16:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:46,798 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-16 00:16:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:16:46,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-16 00:16:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:46,799 INFO L225 Difference]: With dead ends: 65 [2019-11-16 00:16:46,799 INFO L226 Difference]: Without dead ends: 65 [2019-11-16 00:16:46,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:16:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-16 00:16:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-16 00:16:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-16 00:16:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-16 00:16:46,805 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 23 [2019-11-16 00:16:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:46,805 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-16 00:16:46,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:16:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-16 00:16:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:16:46,806 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:46,806 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:46,806 INFO L410 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:46,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:46,807 INFO L82 PathProgramCache]: Analyzing trace with hash 421781909, now seen corresponding path program 1 times [2019-11-16 00:16:46,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:46,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090748931] [2019-11-16 00:16:46,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:46,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:46,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:46,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090748931] [2019-11-16 00:16:46,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992815612] [2019-11-16 00:16:46,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:47,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:16:47,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:16:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:47,042 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:16:47,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 10 [2019-11-16 00:16:47,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029613263] [2019-11-16 00:16:47,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:16:47,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:47,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:16:47,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:16:47,043 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 10 states. [2019-11-16 00:16:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:47,386 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-16 00:16:47,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:16:47,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-16 00:16:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:47,388 INFO L225 Difference]: With dead ends: 70 [2019-11-16 00:16:47,388 INFO L226 Difference]: Without dead ends: 70 [2019-11-16 00:16:47,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:16:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-16 00:16:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-11-16 00:16:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-16 00:16:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-16 00:16:47,394 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2019-11-16 00:16:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:47,394 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-16 00:16:47,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:16:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-16 00:16:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:16:47,400 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:47,400 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:47,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:47,604 INFO L410 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:47,604 INFO L82 PathProgramCache]: Analyzing trace with hash -16477362, now seen corresponding path program 2 times [2019-11-16 00:16:47,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:47,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314561357] [2019-11-16 00:16:47,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:47,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:47,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:47,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314561357] [2019-11-16 00:16:47,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446276629] [2019-11-16 00:16:47,761 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:47,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:16:47,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:16:47,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:16:47,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:16:47,835 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_26|], 20=[|v_#valid_30|]} [2019-11-16 00:16:47,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-11-16 00:16:47,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:16:47,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:16:47,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:47,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:16:47,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 196 [2019-11-16 00:16:47,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:47,953 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:16:48,171 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 38 [2019-11-16 00:16:48,171 INFO L567 ElimStorePlain]: treesize reduction 1731, result has 3.2 percent of original size [2019-11-16 00:16:48,172 INFO L496 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. [2019-11-16 00:16:48,172 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-11-16 00:16:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-16 00:16:48,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:16:48,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 16 [2019-11-16 00:16:48,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105528780] [2019-11-16 00:16:48,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:16:48,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:48,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:16:48,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:16:48,496 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 7 states. [2019-11-16 00:16:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:48,763 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-16 00:16:48,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:16:48,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-16 00:16:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:48,764 INFO L225 Difference]: With dead ends: 68 [2019-11-16 00:16:48,765 INFO L226 Difference]: Without dead ends: 68 [2019-11-16 00:16:48,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:16:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-16 00:16:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-16 00:16:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-16 00:16:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-16 00:16:48,770 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 26 [2019-11-16 00:16:48,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:48,771 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-16 00:16:48,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:16:48,771 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-16 00:16:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:16:48,771 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:48,772 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:48,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:48,981 INFO L410 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:48,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:48,981 INFO L82 PathProgramCache]: Analyzing trace with hash -510798198, now seen corresponding path program 1 times [2019-11-16 00:16:48,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:48,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369136746] [2019-11-16 00:16:48,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:48,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:48,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:49,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369136746] [2019-11-16 00:16:49,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599332459] [2019-11-16 00:16:49,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:49,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:16:49,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:16:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:49,183 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:16:49,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-11-16 00:16:49,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009040838] [2019-11-16 00:16:49,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:16:49,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:49,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:16:49,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:16:49,185 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 8 states. [2019-11-16 00:16:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:49,375 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-11-16 00:16:49,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:16:49,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-16 00:16:49,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:49,377 INFO L225 Difference]: With dead ends: 73 [2019-11-16 00:16:49,377 INFO L226 Difference]: Without dead ends: 73 [2019-11-16 00:16:49,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:16:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-16 00:16:49,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-11-16 00:16:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-16 00:16:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-11-16 00:16:49,383 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 27 [2019-11-16 00:16:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:49,383 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-11-16 00:16:49,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:16:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-11-16 00:16:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:16:49,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:49,384 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:49,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:49,588 INFO L410 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:49,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:49,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1612905533, now seen corresponding path program 2 times [2019-11-16 00:16:49,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:49,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904390214] [2019-11-16 00:16:49,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:49,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:49,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:49,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904390214] [2019-11-16 00:16:49,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590559290] [2019-11-16 00:16:49,709 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:49,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:16:49,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:16:49,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:16:49,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:16:49,973 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-11-16 00:16:49,974 INFO L341 Elim1Store]: treesize reduction 234, result has 29.9 percent of original size [2019-11-16 00:16:49,974 INFO L375 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 4 new quantified variables, introduced 14 case distinctions, treesize of input 179 treesize of output 254 [2019-11-16 00:16:49,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:49,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:50,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:16:50,611 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 51 [2019-11-16 00:16:50,611 INFO L567 ElimStorePlain]: treesize reduction 9122, result has 1.0 percent of original size [2019-11-16 00:16:50,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:50,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:16:50,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-11-16 00:16:50,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:50,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:50,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:50,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:50,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:50,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:50,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:51,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:52,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:52,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:52,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:52,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:52,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:16:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-16 00:16:52,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:16:52,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2019-11-16 00:16:52,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736206789] [2019-11-16 00:16:52,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:16:52,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:52,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:16:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:16:52,328 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 3 states. [2019-11-16 00:16:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:52,358 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-16 00:16:52,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:16:52,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-16 00:16:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:52,360 INFO L225 Difference]: With dead ends: 70 [2019-11-16 00:16:52,360 INFO L226 Difference]: Without dead ends: 70 [2019-11-16 00:16:52,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 27 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:16:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-16 00:16:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-16 00:16:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-16 00:16:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-11-16 00:16:52,365 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 30 [2019-11-16 00:16:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:52,365 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-11-16 00:16:52,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:16:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-11-16 00:16:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:16:52,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:52,366 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:52,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:52,567 INFO L410 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1612905532, now seen corresponding path program 1 times [2019-11-16 00:16:52,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:52,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490665630] [2019-11-16 00:16:52,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:52,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:52,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:52,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490665630] [2019-11-16 00:16:52,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482197062] [2019-11-16 00:16:52,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:52,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:16:52,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:16:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:52,761 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:16:52,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-11-16 00:16:52,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307224851] [2019-11-16 00:16:52,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:16:52,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:52,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:16:52,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:16:52,767 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 9 states. [2019-11-16 00:16:52,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:52,933 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-11-16 00:16:52,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:16:52,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-16 00:16:52,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:52,934 INFO L225 Difference]: With dead ends: 75 [2019-11-16 00:16:52,934 INFO L226 Difference]: Without dead ends: 75 [2019-11-16 00:16:52,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:16:52,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-16 00:16:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-11-16 00:16:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-16 00:16:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-11-16 00:16:52,942 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 30 [2019-11-16 00:16:52,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:52,943 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-11-16 00:16:52,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:16:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-11-16 00:16:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-16 00:16:52,944 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:52,944 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:53,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:53,147 INFO L410 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:53,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:53,148 INFO L82 PathProgramCache]: Analyzing trace with hash 532455403, now seen corresponding path program 2 times [2019-11-16 00:16:53,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:53,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244576896] [2019-11-16 00:16:53,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:53,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:53,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:53,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244576896] [2019-11-16 00:16:53,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253813816] [2019-11-16 00:16:53,278 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:53,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:16:53,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:16:53,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:16:53,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:16:53,357 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_27|], 20=[|v_#valid_32|]} [2019-11-16 00:16:53,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-11-16 00:16:53,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:16:53,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:16:53,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:53,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:16:53,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 141 [2019-11-16 00:16:53,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:53,467 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:16:53,628 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 37 [2019-11-16 00:16:53,629 INFO L567 ElimStorePlain]: treesize reduction 807, result has 6.5 percent of original size [2019-11-16 00:16:53,629 INFO L496 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. [2019-11-16 00:16:53,629 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-11-16 00:16:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-16 00:16:53,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:16:53,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2019-11-16 00:16:53,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299604475] [2019-11-16 00:16:53,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:16:53,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:53,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:16:53,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:16:53,781 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2019-11-16 00:16:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:53,886 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-11-16 00:16:53,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:16:53,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-16 00:16:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:53,888 INFO L225 Difference]: With dead ends: 72 [2019-11-16 00:16:53,888 INFO L226 Difference]: Without dead ends: 72 [2019-11-16 00:16:53,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:16:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-16 00:16:53,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-16 00:16:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-16 00:16:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-11-16 00:16:53,894 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 33 [2019-11-16 00:16:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:53,894 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-11-16 00:16:53,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:16:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-11-16 00:16:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:16:53,909 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:53,909 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:16:54,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:54,110 INFO L410 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:54,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:54,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1031100925, now seen corresponding path program 1 times [2019-11-16 00:16:54,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:54,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223193552] [2019-11-16 00:16:54,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:54,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:54,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-16 00:16:54,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223193552] [2019-11-16 00:16:54,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180875365] [2019-11-16 00:16:54,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:54,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:16:54,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:16:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:16:54,392 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:16:54,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-16 00:16:54,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310335693] [2019-11-16 00:16:54,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:16:54,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:54,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:16:54,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:16:54,393 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 14 states. [2019-11-16 00:16:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:54,693 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2019-11-16 00:16:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:16:54,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-11-16 00:16:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:54,697 INFO L225 Difference]: With dead ends: 92 [2019-11-16 00:16:54,697 INFO L226 Difference]: Without dead ends: 92 [2019-11-16 00:16:54,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:16:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-16 00:16:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2019-11-16 00:16:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-16 00:16:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2019-11-16 00:16:54,702 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 42 [2019-11-16 00:16:54,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:54,702 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2019-11-16 00:16:54,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:16:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2019-11-16 00:16:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:16:54,710 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:54,711 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2019-11-16 00:16:54,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:54,914 INFO L410 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:54,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1496402646, now seen corresponding path program 2 times [2019-11-16 00:16:54,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:54,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011397902] [2019-11-16 00:16:54,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:54,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:54,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-16 00:16:55,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011397902] [2019-11-16 00:16:55,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:55,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:16:55,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293904560] [2019-11-16 00:16:55,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:16:55,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:55,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:16:55,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:16:55,039 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 8 states. [2019-11-16 00:16:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:55,292 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-11-16 00:16:55,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:16:55,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-16 00:16:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:55,293 INFO L225 Difference]: With dead ends: 81 [2019-11-16 00:16:55,294 INFO L226 Difference]: Without dead ends: 81 [2019-11-16 00:16:55,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:16:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-16 00:16:55,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-11-16 00:16:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-16 00:16:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-11-16 00:16:55,297 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 50 [2019-11-16 00:16:55,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:55,297 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-11-16 00:16:55,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:16:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-11-16 00:16:55,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:16:55,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:55,298 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2019-11-16 00:16:55,298 INFO L410 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:55,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:55,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1496402647, now seen corresponding path program 1 times [2019-11-16 00:16:55,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:55,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018179261] [2019-11-16 00:16:55,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:55,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:55,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:55,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018179261] [2019-11-16 00:16:55,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479877582] [2019-11-16 00:16:55,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:55,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:16:55,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:16:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:16:55,595 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:16:55,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 14 [2019-11-16 00:16:55,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573251937] [2019-11-16 00:16:55,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:16:55,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:55,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:16:55,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:16:55,597 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 14 states. [2019-11-16 00:16:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:55,800 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2019-11-16 00:16:55,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:16:55,800 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-11-16 00:16:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:55,801 INFO L225 Difference]: With dead ends: 84 [2019-11-16 00:16:55,801 INFO L226 Difference]: Without dead ends: 84 [2019-11-16 00:16:55,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:16:55,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-16 00:16:55,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-11-16 00:16:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-16 00:16:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-11-16 00:16:55,805 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 50 [2019-11-16 00:16:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:55,806 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2019-11-16 00:16:55,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:16:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2019-11-16 00:16:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:16:55,807 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:55,807 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2019-11-16 00:16:56,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:56,008 INFO L410 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:56,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:56,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1417170302, now seen corresponding path program 2 times [2019-11-16 00:16:56,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:56,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213747186] [2019-11-16 00:16:56,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:56,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:56,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:56,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213747186] [2019-11-16 00:16:56,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125903406] [2019-11-16 00:16:56,313 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:56,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:16:56,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:16:56,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:16:56,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:16:56,387 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_28|], 20=[|v_#valid_33|]} [2019-11-16 00:16:56,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-11-16 00:16:56,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:16:56,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:16:56,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:56,484 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:16:56,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 202 [2019-11-16 00:16:56,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:56,505 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:16:56,777 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 36 [2019-11-16 00:16:56,778 INFO L567 ElimStorePlain]: treesize reduction 1661, result has 3.2 percent of original size [2019-11-16 00:16:56,778 INFO L496 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. [2019-11-16 00:16:56,779 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-11-16 00:16:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-16 00:16:57,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:16:57,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 23 [2019-11-16 00:16:57,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057157358] [2019-11-16 00:16:57,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:16:57,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:16:57,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:16:57,126 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 7 states. [2019-11-16 00:16:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:57,512 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-11-16 00:16:57,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:16:57,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-16 00:16:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:57,513 INFO L225 Difference]: With dead ends: 82 [2019-11-16 00:16:57,513 INFO L226 Difference]: Without dead ends: 82 [2019-11-16 00:16:57,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:16:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-16 00:16:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-11-16 00:16:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-16 00:16:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-11-16 00:16:57,516 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 53 [2019-11-16 00:16:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:57,517 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2019-11-16 00:16:57,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:16:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2019-11-16 00:16:57,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:16:57,518 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:57,518 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2019-11-16 00:16:57,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:57,719 INFO L410 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:57,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:57,719 INFO L82 PathProgramCache]: Analyzing trace with hash 982606402, now seen corresponding path program 1 times [2019-11-16 00:16:57,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:57,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347658172] [2019-11-16 00:16:57,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:57,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:57,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-16 00:16:57,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347658172] [2019-11-16 00:16:57,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:57,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:16:57,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394059424] [2019-11-16 00:16:57,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:16:57,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:57,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:16:57,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:16:57,834 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 5 states. [2019-11-16 00:16:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:57,983 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-11-16 00:16:57,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:16:57,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-11-16 00:16:57,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:57,984 INFO L225 Difference]: With dead ends: 81 [2019-11-16 00:16:57,984 INFO L226 Difference]: Without dead ends: 81 [2019-11-16 00:16:57,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:16:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-16 00:16:57,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-11-16 00:16:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-16 00:16:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-11-16 00:16:57,986 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 54 [2019-11-16 00:16:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:57,987 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-11-16 00:16:57,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:16:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-11-16 00:16:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:16:57,988 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:57,988 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2019-11-16 00:16:57,988 INFO L410 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:57,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:57,988 INFO L82 PathProgramCache]: Analyzing trace with hash 982606403, now seen corresponding path program 1 times [2019-11-16 00:16:57,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:57,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889341737] [2019-11-16 00:16:57,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:57,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:57,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:58,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889341737] [2019-11-16 00:16:58,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944668679] [2019-11-16 00:16:58,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:58,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:16:58,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:16:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:16:58,304 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:16:58,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 15 [2019-11-16 00:16:58,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29896195] [2019-11-16 00:16:58,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:16:58,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:58,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:16:58,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:16:58,305 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 15 states. [2019-11-16 00:16:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:58,542 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2019-11-16 00:16:58,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:16:58,542 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-11-16 00:16:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:58,543 INFO L225 Difference]: With dead ends: 86 [2019-11-16 00:16:58,543 INFO L226 Difference]: Without dead ends: 86 [2019-11-16 00:16:58,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:16:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-16 00:16:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-11-16 00:16:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-16 00:16:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-11-16 00:16:58,547 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 54 [2019-11-16 00:16:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:58,548 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-11-16 00:16:58,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:16:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-11-16 00:16:58,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:16:58,549 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:58,549 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 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] [2019-11-16 00:16:58,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:58,750 INFO L410 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:58,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:58,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1605941610, now seen corresponding path program 2 times [2019-11-16 00:16:58,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:58,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966795329] [2019-11-16 00:16:58,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:58,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:58,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:59,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966795329] [2019-11-16 00:16:59,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627452822] [2019-11-16 00:16:59,049 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:59,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:16:59,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:16:59,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:16:59,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:16:59,140 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_29|], 20=[|v_#valid_34|]} [2019-11-16 00:16:59,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-11-16 00:16:59,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:16:59,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:16:59,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:16:59,224 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:16:59,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 141 [2019-11-16 00:16:59,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:16:59,241 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:16:59,337 INFO L567 ElimStorePlain]: treesize reduction 363, result has 13.2 percent of original size [2019-11-16 00:16:59,338 INFO L496 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. [2019-11-16 00:16:59,338 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-11-16 00:16:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-16 00:16:59,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:16:59,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 19 [2019-11-16 00:16:59,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978193768] [2019-11-16 00:16:59,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:16:59,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:16:59,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:16:59,550 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 5 states. [2019-11-16 00:16:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:59,668 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-11-16 00:16:59,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:16:59,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-16 00:16:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:59,669 INFO L225 Difference]: With dead ends: 83 [2019-11-16 00:16:59,669 INFO L226 Difference]: Without dead ends: 83 [2019-11-16 00:16:59,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:16:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-16 00:16:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-16 00:16:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-16 00:16:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-11-16 00:16:59,673 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 57 [2019-11-16 00:16:59,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:59,673 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-11-16 00:16:59,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:16:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-11-16 00:16:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:16:59,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:59,674 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 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] [2019-11-16 00:16:59,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:59,875 INFO L410 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:16:59,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:59,875 INFO L82 PathProgramCache]: Analyzing trace with hash -770751078, now seen corresponding path program 1 times [2019-11-16 00:16:59,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:59,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838613368] [2019-11-16 00:16:59,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:59,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:59,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-16 00:17:00,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838613368] [2019-11-16 00:17:00,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284130527] [2019-11-16 00:17:00,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:00,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:17:00,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:17:00,232 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:17:00,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2019-11-16 00:17:00,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986336165] [2019-11-16 00:17:00,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-16 00:17:00,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:00,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-16 00:17:00,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:17:00,235 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 17 states. [2019-11-16 00:17:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:00,495 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-11-16 00:17:00,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:17:00,495 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-11-16 00:17:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:00,496 INFO L225 Difference]: With dead ends: 103 [2019-11-16 00:17:00,496 INFO L226 Difference]: Without dead ends: 103 [2019-11-16 00:17:00,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:17:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-16 00:17:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2019-11-16 00:17:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-16 00:17:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2019-11-16 00:17:00,500 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 66 [2019-11-16 00:17:00,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:00,500 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2019-11-16 00:17:00,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-16 00:17:00,500 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2019-11-16 00:17:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:17:00,501 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:00,501 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:00,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:00,705 INFO L410 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:17:00,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:00,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1371104361, now seen corresponding path program 2 times [2019-11-16 00:17:00,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:00,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680887324] [2019-11-16 00:17:00,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:00,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:00,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:17:00,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680887324] [2019-11-16 00:17:00,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:00,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:17:00,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625715500] [2019-11-16 00:17:00,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:17:00,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:00,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:17:00,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:17:00,849 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 8 states. [2019-11-16 00:17:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:01,099 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-11-16 00:17:01,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:17:01,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2019-11-16 00:17:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:01,101 INFO L225 Difference]: With dead ends: 92 [2019-11-16 00:17:01,101 INFO L226 Difference]: Without dead ends: 92 [2019-11-16 00:17:01,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:17:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-16 00:17:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-11-16 00:17:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-16 00:17:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-11-16 00:17:01,104 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 74 [2019-11-16 00:17:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:01,104 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2019-11-16 00:17:01,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:17:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2019-11-16 00:17:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:17:01,105 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:01,105 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:01,106 INFO L410 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:17:01,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:01,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1371104362, now seen corresponding path program 1 times [2019-11-16 00:17:01,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:01,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522060498] [2019-11-16 00:17:01,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:01,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:01,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:01,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522060498] [2019-11-16 00:17:01,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120431688] [2019-11-16 00:17:01,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:01,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:17:01,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:17:01,574 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:17:01,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 20 [2019-11-16 00:17:01,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926083559] [2019-11-16 00:17:01,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:17:01,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:01,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:17:01,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:17:01,576 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 20 states. [2019-11-16 00:17:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:01,859 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-11-16 00:17:01,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:17:01,859 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2019-11-16 00:17:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:01,860 INFO L225 Difference]: With dead ends: 97 [2019-11-16 00:17:01,860 INFO L226 Difference]: Without dead ends: 97 [2019-11-16 00:17:01,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:17:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-16 00:17:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-11-16 00:17:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-16 00:17:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-11-16 00:17:01,863 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 74 [2019-11-16 00:17:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:01,863 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-11-16 00:17:01,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:17:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-11-16 00:17:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-16 00:17:01,864 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:01,865 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:02,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:02,068 INFO L410 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:17:02,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:02,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1142727185, now seen corresponding path program 2 times [2019-11-16 00:17:02,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:02,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753630341] [2019-11-16 00:17:02,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:02,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:02,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-16 00:17:02,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753630341] [2019-11-16 00:17:02,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692363932] [2019-11-16 00:17:02,308 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:02,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:17:02,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:17:02,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:17:02,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:02,388 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 20=[|v_#valid_35|]} [2019-11-16 00:17:02,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-11-16 00:17:02,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:17:02,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:17:02,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:02,456 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:17:02,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 136 [2019-11-16 00:17:02,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:02,468 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:17:02,566 INFO L567 ElimStorePlain]: treesize reduction 810, result has 6.5 percent of original size [2019-11-16 00:17:02,566 INFO L496 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. [2019-11-16 00:17:02,567 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-11-16 00:17:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-16 00:17:02,907 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:17:02,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2019-11-16 00:17:02,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481929491] [2019-11-16 00:17:02,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:17:02,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:02,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:17:02,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:17:02,909 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 7 states. [2019-11-16 00:17:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:03,149 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2019-11-16 00:17:03,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:17:03,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-11-16 00:17:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:03,152 INFO L225 Difference]: With dead ends: 93 [2019-11-16 00:17:03,152 INFO L226 Difference]: Without dead ends: 93 [2019-11-16 00:17:03,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:17:03,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-16 00:17:03,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-11-16 00:17:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-16 00:17:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-11-16 00:17:03,155 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 77 [2019-11-16 00:17:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:03,155 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-11-16 00:17:03,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:17:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-11-16 00:17:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-16 00:17:03,156 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:03,156 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:03,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:03,357 INFO L410 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:17:03,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:03,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1064804319, now seen corresponding path program 1 times [2019-11-16 00:17:03,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:03,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071726051] [2019-11-16 00:17:03,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:03,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:03,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-16 00:17:03,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071726051] [2019-11-16 00:17:03,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:03,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:17:03,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201366428] [2019-11-16 00:17:03,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:17:03,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:03,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:17:03,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:03,471 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 5 states. [2019-11-16 00:17:03,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:03,613 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2019-11-16 00:17:03,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:17:03,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-11-16 00:17:03,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:03,614 INFO L225 Difference]: With dead ends: 92 [2019-11-16 00:17:03,614 INFO L226 Difference]: Without dead ends: 92 [2019-11-16 00:17:03,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:17:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-16 00:17:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-16 00:17:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-16 00:17:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-11-16 00:17:03,617 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 78 [2019-11-16 00:17:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:03,617 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2019-11-16 00:17:03,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:17:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2019-11-16 00:17:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-16 00:17:03,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:03,618 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:03,618 INFO L410 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:17:03,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1064804320, now seen corresponding path program 1 times [2019-11-16 00:17:03,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:03,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983562120] [2019-11-16 00:17:03,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:03,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:03,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-16 00:17:03,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983562120] [2019-11-16 00:17:03,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590179909] [2019-11-16 00:17:03,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:03,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:17:03,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-16 00:17:03,892 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:17:03,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 10 [2019-11-16 00:17:03,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294847692] [2019-11-16 00:17:03,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:17:03,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:03,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:17:03,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:17:03,894 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 10 states. [2019-11-16 00:17:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:04,016 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-11-16 00:17:04,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:17:04,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-11-16 00:17:04,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:04,017 INFO L225 Difference]: With dead ends: 101 [2019-11-16 00:17:04,017 INFO L226 Difference]: Without dead ends: 101 [2019-11-16 00:17:04,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:17:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-16 00:17:04,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-11-16 00:17:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-16 00:17:04,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-11-16 00:17:04,020 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 78 [2019-11-16 00:17:04,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:04,021 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-11-16 00:17:04,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:17:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-11-16 00:17:04,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:17:04,021 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:04,022 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:04,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:04,222 INFO L410 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:17:04,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:04,222 INFO L82 PathProgramCache]: Analyzing trace with hash 233941358, now seen corresponding path program 2 times [2019-11-16 00:17:04,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:04,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470996482] [2019-11-16 00:17:04,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:04,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:04,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-16 00:17:04,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470996482] [2019-11-16 00:17:04,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323032311] [2019-11-16 00:17:04,563 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:04,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:17:04,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:17:04,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:17:04,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:04,655 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|], 13=[|v_#valid_36|]} [2019-11-16 00:17:04,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:04,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:04,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:04,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:04,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:04,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:04,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:04,708 INFO L341 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2019-11-16 00:17:04,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 26 [2019-11-16 00:17:04,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:17:04,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:17:04,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:04,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:04,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:04,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:04,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:04,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:04,769 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:17:04,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 71 [2019-11-16 00:17:04,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:04,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:04,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:04,772 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-16 00:17:04,840 INFO L567 ElimStorePlain]: treesize reduction 87, result has 33.1 percent of original size [2019-11-16 00:17:04,841 INFO L496 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. [2019-11-16 00:17:04,841 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2019-11-16 00:17:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-11-16 00:17:05,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:17:05,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 19 [2019-11-16 00:17:05,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387340561] [2019-11-16 00:17:05,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:17:05,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:05,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:17:05,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:17:05,134 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 5 states. [2019-11-16 00:17:05,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:05,238 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-11-16 00:17:05,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:17:05,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-16 00:17:05,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:05,239 INFO L225 Difference]: With dead ends: 96 [2019-11-16 00:17:05,239 INFO L226 Difference]: Without dead ends: 96 [2019-11-16 00:17:05,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:17:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-16 00:17:05,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-11-16 00:17:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-16 00:17:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-11-16 00:17:05,242 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 83 [2019-11-16 00:17:05,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:05,243 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2019-11-16 00:17:05,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:17:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2019-11-16 00:17:05,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-16 00:17:05,243 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:05,243 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:05,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:05,453 INFO L410 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:17:05,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:05,453 INFO L82 PathProgramCache]: Analyzing trace with hash -951712836, now seen corresponding path program 1 times [2019-11-16 00:17:05,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:05,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107653888] [2019-11-16 00:17:05,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:05,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:05,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-11-16 00:17:05,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107653888] [2019-11-16 00:17:05,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249563528] [2019-11-16 00:17:05,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:05,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:17:05,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-16 00:17:05,795 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:17:05,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-16 00:17:05,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446652277] [2019-11-16 00:17:05,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:17:05,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:05,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:17:05,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:17:05,796 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 12 states. [2019-11-16 00:17:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:06,059 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-11-16 00:17:06,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:17:06,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2019-11-16 00:17:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:06,061 INFO L225 Difference]: With dead ends: 117 [2019-11-16 00:17:06,061 INFO L226 Difference]: Without dead ends: 117 [2019-11-16 00:17:06,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:17:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-16 00:17:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-11-16 00:17:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-16 00:17:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2019-11-16 00:17:06,064 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 92 [2019-11-16 00:17:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:06,064 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2019-11-16 00:17:06,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:17:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2019-11-16 00:17:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-16 00:17:06,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:06,065 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:06,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:06,266 INFO L410 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:17:06,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:06,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1776576828, now seen corresponding path program 2 times [2019-11-16 00:17:06,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:06,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770937205] [2019-11-16 00:17:06,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:06,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:06,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-11-16 00:17:06,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770937205] [2019-11-16 00:17:06,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:06,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:17:06,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493961216] [2019-11-16 00:17:06,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:17:06,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:06,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:17:06,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:17:06,447 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 8 states. [2019-11-16 00:17:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:06,717 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2019-11-16 00:17:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:17:06,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-11-16 00:17:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:06,718 INFO L225 Difference]: With dead ends: 107 [2019-11-16 00:17:06,718 INFO L226 Difference]: Without dead ends: 107 [2019-11-16 00:17:06,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:17:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-16 00:17:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-16 00:17:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-16 00:17:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-11-16 00:17:06,722 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 102 [2019-11-16 00:17:06,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:06,722 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-11-16 00:17:06,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:17:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-11-16 00:17:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-16 00:17:06,723 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:06,723 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:06,723 INFO L410 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:17:06,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:06,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1776576829, now seen corresponding path program 1 times [2019-11-16 00:17:06,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:06,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720616975] [2019-11-16 00:17:06,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:06,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:06,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-16 00:17:07,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720616975] [2019-11-16 00:17:07,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783901696] [2019-11-16 00:17:07,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:07,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:17:07,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-16 00:17:07,159 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:17:07,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 15 [2019-11-16 00:17:07,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919431673] [2019-11-16 00:17:07,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:17:07,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:07,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:17:07,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:17:07,160 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 15 states. [2019-11-16 00:17:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:07,385 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2019-11-16 00:17:07,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:17:07,385 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2019-11-16 00:17:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:07,386 INFO L225 Difference]: With dead ends: 114 [2019-11-16 00:17:07,386 INFO L226 Difference]: Without dead ends: 114 [2019-11-16 00:17:07,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:17:07,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-16 00:17:07,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-16 00:17:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-16 00:17:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2019-11-16 00:17:07,389 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 102 [2019-11-16 00:17:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:07,390 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2019-11-16 00:17:07,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:17:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2019-11-16 00:17:07,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-16 00:17:07,390 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:07,391 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:07,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:07,591 INFO L410 AbstractCegarLoop]: === Iteration 29 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-16 00:17:07,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:07,591 INFO L82 PathProgramCache]: Analyzing trace with hash -270653237, now seen corresponding path program 2 times [2019-11-16 00:17:07,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:07,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393662605] [2019-11-16 00:17:07,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:07,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:07,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-16 00:17:08,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393662605] [2019-11-16 00:17:08,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169176710] [2019-11-16 00:17:08,027 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:08,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:17:08,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:17:08,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-16 00:17:08,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:08,119 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_32|], 13=[|v_#valid_37|]} [2019-11-16 00:17:08,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:08,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:08,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:08,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:08,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:08,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:08,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:08,178 INFO L341 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2019-11-16 00:17:08,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 26 [2019-11-16 00:17:08,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:17:08,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:17:08,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:08,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:08,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:08,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:08,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:08,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:17:08,230 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:17:08,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 100 [2019-11-16 00:17:08,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:08,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:08,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:08,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:08,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:08,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:08,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:08,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:17:08,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:17:08,374 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2019-11-16 00:17:08,374 INFO L567 ElimStorePlain]: treesize reduction 82, result has 33.3 percent of original size [2019-11-16 00:17:08,374 INFO L496 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. [2019-11-16 00:17:08,375 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2019-11-16 00:17:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-11-16 00:17:08,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:17:08,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 24 [2019-11-16 00:17:08,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37813355] [2019-11-16 00:17:08,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:17:08,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:08,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:17:08,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:17:08,798 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 7 states. [2019-11-16 00:17:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:09,025 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2019-11-16 00:17:09,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:17:09,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2019-11-16 00:17:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:09,025 INFO L225 Difference]: With dead ends: 110 [2019-11-16 00:17:09,025 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:17:09,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:17:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:17:09,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:17:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:17:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:17:09,027 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2019-11-16 00:17:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:09,027 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:17:09,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:17:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:17:09,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:17:09,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:09,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:17:09 BoogieIcfgContainer [2019-11-16 00:17:09,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:17:09,232 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:17:09,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:17:09,232 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:17:09,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:16:42" (3/4) ... [2019-11-16 00:17:09,239 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:17:09,245 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-16 00:17:09,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2019-11-16 00:17:09,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2019-11-16 00:17:09,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2019-11-16 00:17:09,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-16 00:17:09,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2019-11-16 00:17:09,255 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-11-16 00:17:09,255 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-16 00:17:09,255 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:17:09,255 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-16 00:17:09,294 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9b538a53-e5e2-4a64-8b25-98ced911032c/bin/uautomizer/witness.graphml [2019-11-16 00:17:09,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:17:09,296 INFO L168 Benchmark]: Toolchain (without parser) took 27845.44 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 488.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -227.7 MB). Peak memory consumption was 261.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:09,296 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:17:09,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:09,297 INFO L168 Benchmark]: Boogie Preprocessor took 41.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:17:09,298 INFO L168 Benchmark]: RCFGBuilder took 580.30 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:09,298 INFO L168 Benchmark]: TraceAbstraction took 26805.79 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.9 MB). Peak memory consumption was 250.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:09,298 INFO L168 Benchmark]: Witness Printer took 63.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:09,300 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 580.30 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26805.79 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.9 MB). Peak memory consumption was 250.3 MB. Max. memory is 11.5 GB. * Witness Printer took 63.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. Result: SAFE, OverallTime: 26.7s, OverallIterations: 29, TraceHistogramMax: 10, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1339 SDtfs, 1245 SDslu, 5672 SDs, 0 SdLazy, 3795 SolverSat, 252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1554 GetRequests, 1181 SyntacticMatches, 28 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 107 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 2661 NumberOfCodeBlocks, 2380 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2612 ConstructedInterpolants, 463 QuantifiedInterpolants, 1977801 SizeOfPredicates, 55 NumberOfNonLiveVariables, 4246 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 49 InterpolantComputations, 17 PerfectInterpolantSequences, 2948/4138 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...