./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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.25-f470102 [2019-12-07 18:25:12,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:25:12,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:25:12,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:25:12,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:25:12,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:25:12,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:25:12,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:25:12,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:25:12,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:25:12,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:25:12,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:25:12,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:25:12,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:25:12,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:25:12,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:25:12,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:25:12,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:25:12,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:25:12,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:25:12,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:25:12,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:25:12,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:25:12,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:25:12,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:25:12,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:25:12,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:25:12,477 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:25:12,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:25:12,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:25:12,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:25:12,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:25:12,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:25:12,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:25:12,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:25:12,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:25:12,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:25:12,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:25:12,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:25:12,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:25:12,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:25:12,482 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 18:25:12,491 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:25:12,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:25:12,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:25:12,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:25:12,493 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:25:12,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:25:12,493 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:25:12,493 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:25:12,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:25:12,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:25:12,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:25:12,493 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:25:12,494 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:25:12,494 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 18:25:12,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:25:12,494 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:25:12,494 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:25:12,494 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:25:12,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:25:12,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:25:12,495 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:25:12,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:25:12,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:25:12,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:25:12,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:25:12,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:25:12,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:25:12,495 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:25:12,496 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_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:12,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:25:12,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:25:12,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:25:12,612 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:25:12,612 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:25:12,613 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c [2019-12-07 18:25:12,652 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/bin/uautomizer/data/84bfe2710/9947d0fe6b4d4cc5ab27c11819109efd/FLAG00d359ea9 [2019-12-07 18:25:13,023 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:25:13,023 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/sv-benchmarks/c/memsafety-ext3/getNumbers4-1.c [2019-12-07 18:25:13,027 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/bin/uautomizer/data/84bfe2710/9947d0fe6b4d4cc5ab27c11819109efd/FLAG00d359ea9 [2019-12-07 18:25:13,425 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/bin/uautomizer/data/84bfe2710/9947d0fe6b4d4cc5ab27c11819109efd [2019-12-07 18:25:13,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:25:13,428 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:25:13,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:25:13,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:25:13,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:25:13,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:25:13" (1/1) ... [2019-12-07 18:25:13,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79351d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:13, skipping insertion in model container [2019-12-07 18:25:13,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:25:13" (1/1) ... [2019-12-07 18:25:13,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:25:13,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:25:13,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:25:13,606 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:25:13,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:25:13,632 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:25:13,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:13 WrapperNode [2019-12-07 18:25:13,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:25:13,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:25:13,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:25:13,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:25:13,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:13" (1/1) ... [2019-12-07 18:25:13,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:13" (1/1) ... [2019-12-07 18:25:13,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:13" (1/1) ... [2019-12-07 18:25:13,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:13" (1/1) ... [2019-12-07 18:25:13,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:13" (1/1) ... [2019-12-07 18:25:13,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:13" (1/1) ... [2019-12-07 18:25:13,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:13" (1/1) ... [2019-12-07 18:25:13,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:25:13,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:25:13,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:25:13,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:25:13,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:13,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:25:13,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:25:13,703 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-12-07 18:25:13,703 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2019-12-07 18:25:13,703 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2019-12-07 18:25:13,704 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2019-12-07 18:25:13,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:25:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-12-07 18:25:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-12-07 18:25:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:25:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2019-12-07 18:25:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:25:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2019-12-07 18:25:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2019-12-07 18:25:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:25:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:25:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:25:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 18:25:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:25:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:25:13,921 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:25:13,921 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 18:25:13,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:25:13 BoogieIcfgContainer [2019-12-07 18:25:13,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:25:13,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:25:13,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:25:13,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:25:13,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:25:13" (1/3) ... [2019-12-07 18:25:13,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fc3c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:25:13, skipping insertion in model container [2019-12-07 18:25:13,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:13" (2/3) ... [2019-12-07 18:25:13,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fc3c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:25:13, skipping insertion in model container [2019-12-07 18:25:13,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:25:13" (3/3) ... [2019-12-07 18:25:13,927 INFO L109 eAbstractionObserver]: Analyzing ICFG getNumbers4-1.c [2019-12-07 18:25:13,933 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:25:13,937 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-12-07 18:25:13,944 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-12-07 18:25:13,956 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:25:13,956 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:25:13,956 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:25:13,956 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:25:13,957 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:25:13,957 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:25:13,957 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:25:13,957 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:25:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-12-07 18:25:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 18:25:13,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:13,974 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:13,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:13,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:13,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2019-12-07 18:25:13,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:13,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106828741] [2019-12-07 18:25:13,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:14,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106828741] [2019-12-07 18:25:14,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:14,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:25:14,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331535037] [2019-12-07 18:25:14,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:25:14,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:14,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:25:14,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:25:14,209 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-12-07 18:25:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:14,443 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2019-12-07 18:25:14,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:25:14,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 18:25:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:14,451 INFO L225 Difference]: With dead ends: 117 [2019-12-07 18:25:14,451 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 18:25:14,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:25:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 18:25:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 63. [2019-12-07 18:25:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 18:25:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-12-07 18:25:14,488 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 12 [2019-12-07 18:25:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:14,489 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-12-07 18:25:14,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:25:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-12-07 18:25:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 18:25:14,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:14,489 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:14,489 INFO L410 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:14,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:14,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2019-12-07 18:25:14,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:14,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913547089] [2019-12-07 18:25:14,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:14,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913547089] [2019-12-07 18:25:14,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:14,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:14,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649576581] [2019-12-07 18:25:14,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:25:14,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:14,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:25:14,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:25:14,596 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 5 states. [2019-12-07 18:25:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:14,776 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-12-07 18:25:14,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:25:14,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 18:25:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:14,777 INFO L225 Difference]: With dead ends: 66 [2019-12-07 18:25:14,777 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 18:25:14,778 INFO L630 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-12-07 18:25:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 18:25:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-12-07 18:25:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 18:25:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-12-07 18:25:14,783 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2019-12-07 18:25:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:14,783 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-12-07 18:25:14,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:25:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-12-07 18:25:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:25:14,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:14,784 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:14,784 INFO L410 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:14,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:14,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2019-12-07 18:25:14,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:14,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673004572] [2019-12-07 18:25:14,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:14,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673004572] [2019-12-07 18:25:14,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234843966] [2019-12-07 18:25:14,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:14,926 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:25:14,931 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:14,962 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_25|], 20=[|v_#valid_29|]} [2019-12-07 18:25:14,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:14,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:14,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:14,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:14,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:14,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:14,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:14,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:14,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:14,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:14,987 INFO L377 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-12-07 18:25:14,988 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:15,008 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:15,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:15,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:15,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:15,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:15,055 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:15,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 296 treesize of output 320 [2019-12-07 18:25:15,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:15,269 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:15,876 WARN L192 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 37 [2019-12-07 18:25:15,877 INFO L614 ElimStorePlain]: treesize reduction 20638, result has 0.3 percent of original size [2019-12-07 18:25:15,879 INFO L534 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-12-07 18:25:15,880 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-12-07 18:25:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:15,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:15,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-12-07 18:25:15,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130359803] [2019-12-07 18:25:15,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:25:15,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:15,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:25:15,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:25:15,970 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 9 states. [2019-12-07 18:25:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:16,261 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-12-07 18:25:16,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:25:16,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 18:25:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:16,262 INFO L225 Difference]: With dead ends: 69 [2019-12-07 18:25:16,262 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 18:25:16,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:25:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 18:25:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-12-07 18:25:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 18:25:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-12-07 18:25:16,267 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-12-07 18:25:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:16,267 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-12-07 18:25:16,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:25:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-12-07 18:25:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:25:16,268 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:16,268 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:16,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:16,469 INFO L410 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:16,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:16,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1917592711, now seen corresponding path program 2 times [2019-12-07 18:25:16,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:16,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609633198] [2019-12-07 18:25:16,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:16,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609633198] [2019-12-07 18:25:16,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845850451] [2019-12-07 18:25:16,580 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:16,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:25:16,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:25:16,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:25:16,617 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:16,621 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_26|], 20=[|v_#valid_30|]} [2019-12-07 18:25:16,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,636 INFO L377 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-12-07 18:25:16,636 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:16,652 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:16,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:16,690 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:16,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 182 treesize of output 220 [2019-12-07 18:25:16,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:16,806 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:16,987 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 37 [2019-12-07 18:25:16,988 INFO L614 ElimStorePlain]: treesize reduction 10492, result has 0.5 percent of original size [2019-12-07 18:25:16,989 INFO L534 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-12-07 18:25:16,989 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-12-07 18:25:17,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:17,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:25:17,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2019-12-07 18:25:17,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516386947] [2019-12-07 18:25:17,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:25:17,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:17,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:25:17,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:25:17,149 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 7 states. [2019-12-07 18:25:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:17,229 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-12-07 18:25:17,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:25:17,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-07 18:25:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:17,230 INFO L225 Difference]: With dead ends: 68 [2019-12-07 18:25:17,231 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 18:25:17,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:25:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 18:25:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-12-07 18:25:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 18:25:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-12-07 18:25:17,235 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 18 [2019-12-07 18:25:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:17,235 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-12-07 18:25:17,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:25:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-12-07 18:25:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:25:17,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:17,235 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:17,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:17,437 INFO L410 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:17,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash 421781908, now seen corresponding path program 1 times [2019-12-07 18:25:17,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:17,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264895467] [2019-12-07 18:25:17,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:25:17,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264895467] [2019-12-07 18:25:17,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:17,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:25:17,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170992698] [2019-12-07 18:25:17,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:25:17,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:17,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:25:17,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:25:17,623 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 8 states. [2019-12-07 18:25:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:17,809 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-12-07 18:25:17,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:25:17,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-07 18:25:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:17,814 INFO L225 Difference]: With dead ends: 65 [2019-12-07 18:25:17,814 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 18:25:17,815 INFO L630 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-12-07 18:25:17,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 18:25:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-12-07 18:25:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 18:25:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-12-07 18:25:17,818 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 23 [2019-12-07 18:25:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:17,818 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-12-07 18:25:17,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:25:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-12-07 18:25:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:25:17,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:17,819 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:17,819 INFO L410 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:17,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:17,820 INFO L82 PathProgramCache]: Analyzing trace with hash 421781909, now seen corresponding path program 1 times [2019-12-07 18:25:17,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:17,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789491144] [2019-12-07 18:25:17,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:17,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789491144] [2019-12-07 18:25:17,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871932390] [2019-12-07 18:25:17,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:17,950 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:25:17,952 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:17,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:17,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 10 [2019-12-07 18:25:17,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006690383] [2019-12-07 18:25:17,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:25:17,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:17,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:25:17,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:25:17,956 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 10 states. [2019-12-07 18:25:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:18,161 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-12-07 18:25:18,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:25:18,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-12-07 18:25:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:18,162 INFO L225 Difference]: With dead ends: 70 [2019-12-07 18:25:18,162 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 18:25:18,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:25:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 18:25:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-12-07 18:25:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 18:25:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-12-07 18:25:18,165 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2019-12-07 18:25:18,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:18,166 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-12-07 18:25:18,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:25:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-12-07 18:25:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:25:18,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:18,166 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:18,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:18,368 INFO L410 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:18,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:18,368 INFO L82 PathProgramCache]: Analyzing trace with hash -16477362, now seen corresponding path program 2 times [2019-12-07 18:25:18,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:18,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585833624] [2019-12-07 18:25:18,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:18,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585833624] [2019-12-07 18:25:18,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309071244] [2019-12-07 18:25:18,499 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:18,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 18:25:18,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:25:18,530 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 18:25:18,532 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:18,535 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_27|], 20=[|v_#valid_31|]} [2019-12-07 18:25:18,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,547 INFO L377 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-12-07 18:25:18,548 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:18,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:18,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:18,600 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:18,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 165 [2019-12-07 18:25:18,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:18,678 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:18,897 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 37 [2019-12-07 18:25:18,897 INFO L614 ElimStorePlain]: treesize reduction 6507, result has 0.8 percent of original size [2019-12-07 18:25:18,898 INFO L534 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-12-07 18:25:18,898 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2019-12-07 18:25:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 18:25:19,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:25:19,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 16 [2019-12-07 18:25:19,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360901946] [2019-12-07 18:25:19,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:25:19,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:19,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:25:19,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:25:19,086 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 7 states. [2019-12-07 18:25:19,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:19,334 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-12-07 18:25:19,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:25:19,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-07 18:25:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:19,335 INFO L225 Difference]: With dead ends: 68 [2019-12-07 18:25:19,335 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 18:25:19,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:25:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 18:25:19,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-07 18:25:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 18:25:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-12-07 18:25:19,339 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 26 [2019-12-07 18:25:19,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:19,339 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-12-07 18:25:19,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:25:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-12-07 18:25:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:25:19,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:19,340 INFO L410 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-12-07 18:25:19,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:19,541 INFO L410 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:19,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:19,542 INFO L82 PathProgramCache]: Analyzing trace with hash -510798198, now seen corresponding path program 1 times [2019-12-07 18:25:19,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:19,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282373365] [2019-12-07 18:25:19,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 18:25:19,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282373365] [2019-12-07 18:25:19,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:19,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:25:19,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781244390] [2019-12-07 18:25:19,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:25:19,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:19,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:25:19,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:25:19,635 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2019-12-07 18:25:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:19,741 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-12-07 18:25:19,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:25:19,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 18:25:19,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:19,743 INFO L225 Difference]: With dead ends: 67 [2019-12-07 18:25:19,743 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 18:25:19,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-12-07 18:25:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 18:25:19,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-12-07 18:25:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 18:25:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-12-07 18:25:19,746 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 27 [2019-12-07 18:25:19,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:19,746 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-12-07 18:25:19,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:25:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-12-07 18:25:19,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:25:19,747 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:19,747 INFO L410 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-12-07 18:25:19,747 INFO L410 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:19,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:19,747 INFO L82 PathProgramCache]: Analyzing trace with hash -510798197, now seen corresponding path program 1 times [2019-12-07 18:25:19,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:19,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657481673] [2019-12-07 18:25:19,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:19,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657481673] [2019-12-07 18:25:19,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023809405] [2019-12-07 18:25:19,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:19,840 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:25:19,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:19,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:19,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-12-07 18:25:19,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923057120] [2019-12-07 18:25:19,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:25:19,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:19,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:25:19,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:25:19,844 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 8 states. [2019-12-07 18:25:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:19,945 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-12-07 18:25:19,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:25:19,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-07 18:25:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:19,946 INFO L225 Difference]: With dead ends: 72 [2019-12-07 18:25:19,946 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 18:25:19,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:25:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 18:25:19,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-12-07 18:25:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 18:25:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-12-07 18:25:19,949 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 27 [2019-12-07 18:25:19,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:19,950 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-12-07 18:25:19,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:25:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-12-07 18:25:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:25:19,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:19,950 INFO L410 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-12-07 18:25:20,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:20,152 INFO L410 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:20,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:20,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1612905532, now seen corresponding path program 2 times [2019-12-07 18:25:20,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:20,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300418478] [2019-12-07 18:25:20,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:20,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300418478] [2019-12-07 18:25:20,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097194885] [2019-12-07 18:25:20,367 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:20,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 18:25:20,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:25:20,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 18:25:20,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:20,406 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_28|], 14=[|v_#valid_32|]} [2019-12-07 18:25:20,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:20,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:20,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:20,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:20,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:20,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:20,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:20,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:20,438 INFO L343 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2019-12-07 18:25:20,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 40 [2019-12-07 18:25:20,439 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:20,473 INFO L614 ElimStorePlain]: treesize reduction 10, result has 89.0 percent of original size [2019-12-07 18:25:20,496 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:20,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 153 [2019-12-07 18:25:20,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,512 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:20,628 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 38 [2019-12-07 18:25:20,629 INFO L614 ElimStorePlain]: treesize reduction 1299, result has 4.2 percent of original size [2019-12-07 18:25:20,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,630 INFO L534 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-12-07 18:25:20,630 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:70, output treesize:57 [2019-12-07 18:25:20,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:20,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:21,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:21,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:21,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:21,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:21,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:21,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:21,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:21,440 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 18:25:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 18:25:21,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:25:21,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-12-07 18:25:21,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323458395] [2019-12-07 18:25:21,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:25:21,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:21,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:25:21,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:25:21,569 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-12-07 18:25:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:21,687 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-12-07 18:25:21,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:25:21,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 18:25:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:21,688 INFO L225 Difference]: With dead ends: 69 [2019-12-07 18:25:21,688 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 18:25:21,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 24 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:25:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 18:25:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-12-07 18:25:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 18:25:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-12-07 18:25:21,692 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 30 [2019-12-07 18:25:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:21,692 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-12-07 18:25:21,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:25:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-12-07 18:25:21,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:25:21,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:21,694 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:21,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:21,896 INFO L410 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:21,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:21,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1515534916, now seen corresponding path program 1 times [2019-12-07 18:25:21,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:21,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930156916] [2019-12-07 18:25:21,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 18:25:21,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930156916] [2019-12-07 18:25:21,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371720136] [2019-12-07 18:25:21,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:22,018 INFO L264 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:25:22,019 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:25:22,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:22,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-12-07 18:25:22,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836938871] [2019-12-07 18:25:22,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:25:22,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:22,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:25:22,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:25:22,055 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 13 states. [2019-12-07 18:25:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:22,218 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-12-07 18:25:22,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:25:22,219 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-12-07 18:25:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:22,221 INFO L225 Difference]: With dead ends: 89 [2019-12-07 18:25:22,221 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 18:25:22,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:25:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 18:25:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-12-07 18:25:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 18:25:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2019-12-07 18:25:22,224 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 39 [2019-12-07 18:25:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:22,224 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2019-12-07 18:25:22,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:25:22,224 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2019-12-07 18:25:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:25:22,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:22,225 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 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-12-07 18:25:22,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:22,426 INFO L410 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:22,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:22,426 INFO L82 PathProgramCache]: Analyzing trace with hash 657191965, now seen corresponding path program 2 times [2019-12-07 18:25:22,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:22,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150161445] [2019-12-07 18:25:22,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 18:25:22,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150161445] [2019-12-07 18:25:22,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:22,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:25:22,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051777641] [2019-12-07 18:25:22,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:25:22,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:22,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:25:22,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:25:22,506 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2019-12-07 18:25:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:22,660 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-12-07 18:25:22,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:25:22,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-12-07 18:25:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:22,661 INFO L225 Difference]: With dead ends: 78 [2019-12-07 18:25:22,662 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 18:25:22,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:25:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 18:25:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-12-07 18:25:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 18:25:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-12-07 18:25:22,664 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 47 [2019-12-07 18:25:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:22,664 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2019-12-07 18:25:22,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:25:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2019-12-07 18:25:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:25:22,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:22,665 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 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-12-07 18:25:22,665 INFO L410 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash 657191966, now seen corresponding path program 1 times [2019-12-07 18:25:22,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:22,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786602879] [2019-12-07 18:25:22,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:22,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786602879] [2019-12-07 18:25:22,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105346961] [2019-12-07 18:25:22,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:22,809 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:25:22,811 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:25:22,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:22,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 13 [2019-12-07 18:25:22,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225088148] [2019-12-07 18:25:22,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:25:22,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:22,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:25:22,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:25:22,818 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 13 states. [2019-12-07 18:25:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:22,934 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-12-07 18:25:22,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:25:22,934 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-12-07 18:25:22,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:22,935 INFO L225 Difference]: With dead ends: 81 [2019-12-07 18:25:22,935 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 18:25:22,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:25:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 18:25:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-12-07 18:25:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 18:25:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-12-07 18:25:22,938 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 47 [2019-12-07 18:25:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:22,938 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-12-07 18:25:22,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:25:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-12-07 18:25:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:25:22,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:22,939 INFO L410 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-12-07 18:25:23,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:23,139 INFO L410 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:23,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:23,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1496402647, now seen corresponding path program 2 times [2019-12-07 18:25:23,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:23,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131721269] [2019-12-07 18:25:23,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:23,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131721269] [2019-12-07 18:25:23,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044829808] [2019-12-07 18:25:23,253 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:23,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 18:25:23,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:25:23,287 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 18:25:23,288 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:23,339 INFO L343 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2019-12-07 18:25:23,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 49 [2019-12-07 18:25:23,339 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:23,363 INFO L614 ElimStorePlain]: treesize reduction 10, result has 80.8 percent of original size [2019-12-07 18:25:23,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:23,364 INFO L534 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-12-07 18:25:23,364 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:42 [2019-12-07 18:25:23,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-12-07 18:25:23,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:25:23,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 19 [2019-12-07 18:25:23,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86441016] [2019-12-07 18:25:23,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:25:23,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:23,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:25:23,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:25:23,440 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 7 states. [2019-12-07 18:25:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:23,547 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-12-07 18:25:23,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:25:23,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 18:25:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:23,549 INFO L225 Difference]: With dead ends: 79 [2019-12-07 18:25:23,549 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 18:25:23,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:25:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 18:25:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-12-07 18:25:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 18:25:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-12-07 18:25:23,552 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 50 [2019-12-07 18:25:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:23,552 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-12-07 18:25:23,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:25:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-12-07 18:25:23,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:25:23,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:23,553 INFO L410 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, 1] [2019-12-07 18:25:23,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:23,755 INFO L410 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:23,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:23,755 INFO L82 PathProgramCache]: Analyzing trace with hash -856158199, now seen corresponding path program 1 times [2019-12-07 18:25:23,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:23,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680937262] [2019-12-07 18:25:23,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-12-07 18:25:23,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680937262] [2019-12-07 18:25:23,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:23,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:25:23,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207266582] [2019-12-07 18:25:23,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:25:23,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:23,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:25:23,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:25:23,857 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 5 states. [2019-12-07 18:25:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:23,959 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-12-07 18:25:23,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:25:23,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 18:25:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:23,959 INFO L225 Difference]: With dead ends: 78 [2019-12-07 18:25:23,959 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 18:25:23,960 INFO L630 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-12-07 18:25:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 18:25:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-07 18:25:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 18:25:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-12-07 18:25:23,961 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 51 [2019-12-07 18:25:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:23,962 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-12-07 18:25:23,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:25:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-12-07 18:25:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:25:23,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:23,962 INFO L410 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, 1] [2019-12-07 18:25:23,962 INFO L410 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:23,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash -856158198, now seen corresponding path program 1 times [2019-12-07 18:25:23,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:23,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862298965] [2019-12-07 18:25:23,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-12-07 18:25:24,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862298965] [2019-12-07 18:25:24,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:24,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:25:24,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499830375] [2019-12-07 18:25:24,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:25:24,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:24,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:25:24,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:25:24,039 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 6 states. [2019-12-07 18:25:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:24,168 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-12-07 18:25:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:25:24,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-07 18:25:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:24,169 INFO L225 Difference]: With dead ends: 82 [2019-12-07 18:25:24,169 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 18:25:24,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:25:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 18:25:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-12-07 18:25:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 18:25:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-12-07 18:25:24,171 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 51 [2019-12-07 18:25:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:24,172 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-12-07 18:25:24,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:25:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-12-07 18:25:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 18:25:24,172 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:24,172 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2019-12-07 18:25:24,172 INFO L410 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:24,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:24,173 INFO L82 PathProgramCache]: Analyzing trace with hash -321031436, now seen corresponding path program 1 times [2019-12-07 18:25:24,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:24,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920141632] [2019-12-07 18:25:24,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:25:24,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920141632] [2019-12-07 18:25:24,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312016210] [2019-12-07 18:25:24,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:24,341 INFO L264 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:25:24,343 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:25:24,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:24,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 14 [2019-12-07 18:25:24,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039658072] [2019-12-07 18:25:24,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:25:24,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:24,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:25:24,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:25:24,348 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 14 states. [2019-12-07 18:25:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:24,479 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-12-07 18:25:24,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:25:24,479 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-07 18:25:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:24,480 INFO L225 Difference]: With dead ends: 85 [2019-12-07 18:25:24,480 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 18:25:24,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 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-12-07 18:25:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 18:25:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-12-07 18:25:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 18:25:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-12-07 18:25:24,482 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 56 [2019-12-07 18:25:24,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:24,482 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-12-07 18:25:24,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:25:24,482 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-12-07 18:25:24,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:25:24,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:24,483 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2019-12-07 18:25:24,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:24,684 INFO L410 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:24,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:24,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1703648347, now seen corresponding path program 2 times [2019-12-07 18:25:24,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:24,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477499228] [2019-12-07 18:25:24,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:24,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477499228] [2019-12-07 18:25:24,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081601772] [2019-12-07 18:25:24,967 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:25,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 18:25:25,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:25:25,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:25:25,003 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:25,005 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_30|], 15=[|v_#valid_33|]} [2019-12-07 18:25:25,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:25,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:25,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:25,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:25,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:25,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:25,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:25,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:25,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:25,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:25,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 40 [2019-12-07 18:25:25,024 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:25,057 INFO L614 ElimStorePlain]: treesize reduction 10, result has 89.7 percent of original size [2019-12-07 18:25:25,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:25,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 174 [2019-12-07 18:25:25,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,088 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:25,207 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 41 [2019-12-07 18:25:25,208 INFO L614 ElimStorePlain]: treesize reduction 1627, result has 3.6 percent of original size [2019-12-07 18:25:25,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,209 INFO L534 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-12-07 18:25:25,209 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:76, output treesize:60 [2019-12-07 18:25:25,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:25,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:26,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-07 18:25:27,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:27,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 27 [2019-12-07 18:25:27,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207945844] [2019-12-07 18:25:27,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 18:25:27,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:27,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 18:25:27,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:25:27,230 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 27 states. [2019-12-07 18:25:27,562 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-12-07 18:25:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:28,779 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-12-07 18:25:28,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 18:25:28,780 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2019-12-07 18:25:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:28,781 INFO L225 Difference]: With dead ends: 87 [2019-12-07 18:25:28,781 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 18:25:28,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 11 SyntacticMatches, 45 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=263, Invalid=1543, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 18:25:28,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 18:25:28,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-12-07 18:25:28,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 18:25:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-12-07 18:25:28,784 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 59 [2019-12-07 18:25:28,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:28,785 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-12-07 18:25:28,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 18:25:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-12-07 18:25:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:25:28,786 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:28,786 INFO L410 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-12-07 18:25:28,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:28,987 INFO L410 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:28,988 INFO L82 PathProgramCache]: Analyzing trace with hash -770751078, now seen corresponding path program 1 times [2019-12-07 18:25:28,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:28,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658205406] [2019-12-07 18:25:28,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-12-07 18:25:29,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658205406] [2019-12-07 18:25:29,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780710944] [2019-12-07 18:25:29,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,124 INFO L264 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:25:29,125 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 18:25:29,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:29,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2019-12-07 18:25:29,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405443228] [2019-12-07 18:25:29,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 18:25:29,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:29,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 18:25:29,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:25:29,196 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 17 states. [2019-12-07 18:25:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:29,362 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-12-07 18:25:29,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:25:29,363 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-07 18:25:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:29,364 INFO L225 Difference]: With dead ends: 103 [2019-12-07 18:25:29,364 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 18:25:29,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:25:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 18:25:29,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2019-12-07 18:25:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 18:25:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2019-12-07 18:25:29,367 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 66 [2019-12-07 18:25:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:29,368 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2019-12-07 18:25:29,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 18:25:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2019-12-07 18:25:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:25:29,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:29,369 INFO L410 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-12-07 18:25:29,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:29,570 INFO L410 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1371104361, now seen corresponding path program 2 times [2019-12-07 18:25:29,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:29,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603398835] [2019-12-07 18:25:29,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-12-07 18:25:29,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603398835] [2019-12-07 18:25:29,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:29,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:25:29,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377698704] [2019-12-07 18:25:29,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:25:29,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:29,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:25:29,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:25:29,695 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 8 states. [2019-12-07 18:25:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:29,858 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-12-07 18:25:29,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:25:29,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2019-12-07 18:25:29,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:29,859 INFO L225 Difference]: With dead ends: 92 [2019-12-07 18:25:29,859 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 18:25:29,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:25:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 18:25:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-12-07 18:25:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 18:25:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-12-07 18:25:29,861 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 74 [2019-12-07 18:25:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:29,861 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2019-12-07 18:25:29,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:25:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2019-12-07 18:25:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:25:29,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:29,862 INFO L410 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-12-07 18:25:29,862 INFO L410 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1371104362, now seen corresponding path program 1 times [2019-12-07 18:25:29,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:29,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564953165] [2019-12-07 18:25:29,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:30,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564953165] [2019-12-07 18:25:30,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392336050] [2019-12-07 18:25:30,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:30,189 INFO L264 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 18:25:30,190 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 18:25:30,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:30,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12] total 23 [2019-12-07 18:25:30,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571047151] [2019-12-07 18:25:30,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 18:25:30,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:30,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 18:25:30,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:25:30,199 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 23 states. [2019-12-07 18:25:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:30,675 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-12-07 18:25:30,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 18:25:30,676 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2019-12-07 18:25:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:30,676 INFO L225 Difference]: With dead ends: 97 [2019-12-07 18:25:30,676 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 18:25:30,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 18:25:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 18:25:30,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-12-07 18:25:30,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 18:25:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-12-07 18:25:30,680 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 74 [2019-12-07 18:25:30,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:30,680 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-12-07 18:25:30,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 18:25:30,680 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-12-07 18:25:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 18:25:30,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:30,680 INFO L410 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-12-07 18:25:30,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:30,881 INFO L410 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:30,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:30,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1142727185, now seen corresponding path program 2 times [2019-12-07 18:25:30,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:30,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034995794] [2019-12-07 18:25:30,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-12-07 18:25:31,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034995794] [2019-12-07 18:25:31,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094436217] [2019-12-07 18:25:31,039 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:31,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 18:25:31,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:25:31,076 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 18:25:31,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:31,131 INFO L343 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2019-12-07 18:25:31,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 49 [2019-12-07 18:25:31,131 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:31,156 INFO L614 ElimStorePlain]: treesize reduction 10, result has 80.8 percent of original size [2019-12-07 18:25:31,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:31,157 INFO L534 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-12-07 18:25:31,157 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:42 [2019-12-07 18:25:31,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 18:25:31,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:25:31,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2019-12-07 18:25:31,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746920929] [2019-12-07 18:25:31,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:25:31,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:31,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:25:31,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:25:31,220 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 7 states. [2019-12-07 18:25:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:31,316 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2019-12-07 18:25:31,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:25:31,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-12-07 18:25:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:31,317 INFO L225 Difference]: With dead ends: 93 [2019-12-07 18:25:31,317 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 18:25:31,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:25:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 18:25:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-12-07 18:25:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 18:25:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-12-07 18:25:31,320 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 77 [2019-12-07 18:25:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:31,320 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-12-07 18:25:31,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:25:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-12-07 18:25:31,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 18:25:31,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:31,320 INFO L410 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-12-07 18:25:31,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:31,521 INFO L410 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:31,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1064804319, now seen corresponding path program 1 times [2019-12-07 18:25:31,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:31,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477273517] [2019-12-07 18:25:31,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 18:25:31,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477273517] [2019-12-07 18:25:31,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:31,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:25:31,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472488241] [2019-12-07 18:25:31,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:25:31,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:31,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:25:31,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:25:31,651 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 5 states. [2019-12-07 18:25:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:31,744 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2019-12-07 18:25:31,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:25:31,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-12-07 18:25:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:31,745 INFO L225 Difference]: With dead ends: 92 [2019-12-07 18:25:31,745 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 18:25:31,745 INFO L630 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-12-07 18:25:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 18:25:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-12-07 18:25:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 18:25:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-12-07 18:25:31,747 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 78 [2019-12-07 18:25:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:31,748 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2019-12-07 18:25:31,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:25:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2019-12-07 18:25:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 18:25:31,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:31,749 INFO L410 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-12-07 18:25:31,749 INFO L410 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:31,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:31,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1064804320, now seen corresponding path program 1 times [2019-12-07 18:25:31,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:31,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152869181] [2019-12-07 18:25:31,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-12-07 18:25:31,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152869181] [2019-12-07 18:25:31,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392277118] [2019-12-07 18:25:31,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:32,000 INFO L264 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:25:32,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 18:25:32,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:32,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 15 [2019-12-07 18:25:32,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201101606] [2019-12-07 18:25:32,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:25:32,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:32,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:25:32,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:25:32,009 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 15 states. [2019-12-07 18:25:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:32,260 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-12-07 18:25:32,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:25:32,261 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2019-12-07 18:25:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:32,261 INFO L225 Difference]: With dead ends: 103 [2019-12-07 18:25:32,261 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 18:25:32,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:25:32,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 18:25:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-12-07 18:25:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 18:25:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-12-07 18:25:32,264 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 78 [2019-12-07 18:25:32,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:32,264 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-12-07 18:25:32,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:25:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-12-07 18:25:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 18:25:32,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:32,264 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 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] [2019-12-07 18:25:32,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:32,465 INFO L410 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:32,466 INFO L82 PathProgramCache]: Analyzing trace with hash 484778976, now seen corresponding path program 1 times [2019-12-07 18:25:32,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:32,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197009409] [2019-12-07 18:25:32,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 18:25:32,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197009409] [2019-12-07 18:25:32,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525335333] [2019-12-07 18:25:32,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:32,651 INFO L264 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:25:32,652 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 18:25:32,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:32,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 11 [2019-12-07 18:25:32,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964536345] [2019-12-07 18:25:32,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:25:32,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:32,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:25:32,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:25:32,659 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 11 states. [2019-12-07 18:25:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:32,725 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2019-12-07 18:25:32,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:25:32,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-12-07 18:25:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:32,726 INFO L225 Difference]: With dead ends: 108 [2019-12-07 18:25:32,726 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 18:25:32,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:25:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 18:25:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2019-12-07 18:25:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 18:25:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2019-12-07 18:25:32,728 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 88 [2019-12-07 18:25:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:32,729 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2019-12-07 18:25:32,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:25:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2019-12-07 18:25:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 18:25:32,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:32,729 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 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] [2019-12-07 18:25:32,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:32,930 INFO L410 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:32,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:32,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1006834670, now seen corresponding path program 2 times [2019-12-07 18:25:32,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:32,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960460730] [2019-12-07 18:25:32,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 18:25:33,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960460730] [2019-12-07 18:25:33,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075262223] [2019-12-07 18:25:33,070 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:33,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 18:25:33,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:25:33,107 INFO L264 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:25:33,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:33,159 INFO L343 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2019-12-07 18:25:33,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 49 [2019-12-07 18:25:33,160 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:33,185 INFO L614 ElimStorePlain]: treesize reduction 10, result has 81.8 percent of original size [2019-12-07 18:25:33,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:33,186 INFO L534 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-12-07 18:25:33,187 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:25, output treesize:45 [2019-12-07 18:25:33,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-12-07 18:25:33,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:33,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 18 [2019-12-07 18:25:33,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279308577] [2019-12-07 18:25:33,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 18:25:33,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:33,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 18:25:33,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:25:33,296 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 18 states. [2019-12-07 18:25:33,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:33,671 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2019-12-07 18:25:33,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:25:33,671 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-12-07 18:25:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:33,672 INFO L225 Difference]: With dead ends: 112 [2019-12-07 18:25:33,672 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 18:25:33,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:25:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 18:25:33,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2019-12-07 18:25:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 18:25:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2019-12-07 18:25:33,675 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 93 [2019-12-07 18:25:33,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:33,675 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2019-12-07 18:25:33,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 18:25:33,675 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2019-12-07 18:25:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 18:25:33,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:33,676 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 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-12-07 18:25:33,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:33,877 INFO L410 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:33,878 INFO L82 PathProgramCache]: Analyzing trace with hash 239434876, now seen corresponding path program 1 times [2019-12-07 18:25:33,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:33,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581051679] [2019-12-07 18:25:33,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-07 18:25:34,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581051679] [2019-12-07 18:25:34,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270508498] [2019-12-07 18:25:34,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,053 INFO L264 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:25:34,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-12-07 18:25:34,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:34,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-12-07 18:25:34,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162973339] [2019-12-07 18:25:34,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:25:34,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:34,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:25:34,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:25:34,101 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 14 states. [2019-12-07 18:25:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:34,242 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2019-12-07 18:25:34,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:25:34,243 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2019-12-07 18:25:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:34,243 INFO L225 Difference]: With dead ends: 127 [2019-12-07 18:25:34,243 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 18:25:34,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:25:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 18:25:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2019-12-07 18:25:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-07 18:25:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2019-12-07 18:25:34,246 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 102 [2019-12-07 18:25:34,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:34,246 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2019-12-07 18:25:34,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:25:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2019-12-07 18:25:34,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 18:25:34,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:34,246 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 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-12-07 18:25:34,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:34,447 INFO L410 AbstractCegarLoop]: === Iteration 28 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:34,448 INFO L82 PathProgramCache]: Analyzing trace with hash 494137852, now seen corresponding path program 2 times [2019-12-07 18:25:34,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:34,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878947247] [2019-12-07 18:25:34,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-12-07 18:25:34,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878947247] [2019-12-07 18:25:34,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:34,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:25:34,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669364799] [2019-12-07 18:25:34,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:25:34,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:34,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:25:34,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:25:34,594 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand 8 states. [2019-12-07 18:25:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:34,736 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2019-12-07 18:25:34,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:25:34,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-12-07 18:25:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:34,736 INFO L225 Difference]: With dead ends: 117 [2019-12-07 18:25:34,736 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 18:25:34,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:25:34,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 18:25:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-12-07 18:25:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 18:25:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-12-07 18:25:34,739 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 112 [2019-12-07 18:25:34,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:34,739 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-12-07 18:25:34,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:25:34,739 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-12-07 18:25:34,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 18:25:34,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:34,740 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 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-12-07 18:25:34,740 INFO L410 AbstractCegarLoop]: === Iteration 29 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:34,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:34,740 INFO L82 PathProgramCache]: Analyzing trace with hash 494137853, now seen corresponding path program 1 times [2019-12-07 18:25:34,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:34,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679615576] [2019-12-07 18:25:34,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-12-07 18:25:34,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679615576] [2019-12-07 18:25:34,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293526880] [2019-12-07 18:25:34,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:35,026 INFO L264 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:25:35,028 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 18:25:35,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:35,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 20 [2019-12-07 18:25:35,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525181650] [2019-12-07 18:25:35,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 18:25:35,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:35,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 18:25:35,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:25:35,037 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 20 states. [2019-12-07 18:25:35,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:35,359 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2019-12-07 18:25:35,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:25:35,359 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 112 [2019-12-07 18:25:35,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:35,360 INFO L225 Difference]: With dead ends: 124 [2019-12-07 18:25:35,360 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 18:25:35,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:25:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 18:25:35,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-12-07 18:25:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 18:25:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2019-12-07 18:25:35,363 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 112 [2019-12-07 18:25:35,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:35,363 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2019-12-07 18:25:35,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 18:25:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2019-12-07 18:25:35,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 18:25:35,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:35,364 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 7, 7, 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-12-07 18:25:35,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:35,565 INFO L410 AbstractCegarLoop]: === Iteration 30 === [getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-12-07 18:25:35,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:35,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2019956747, now seen corresponding path program 2 times [2019-12-07 18:25:35,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:35,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517398659] [2019-12-07 18:25:35,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-12-07 18:25:35,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517398659] [2019-12-07 18:25:35,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843985113] [2019-12-07 18:25:35,840 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/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-12-07 18:25:35,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 18:25:35,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:25:35,880 INFO L264 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 18:25:35,882 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:35,933 INFO L343 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2019-12-07 18:25:35,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 49 [2019-12-07 18:25:35,933 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:35,956 INFO L614 ElimStorePlain]: treesize reduction 10, result has 80.8 percent of original size [2019-12-07 18:25:35,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:35,957 INFO L534 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-12-07 18:25:35,957 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:42 [2019-12-07 18:25:35,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:25:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-12-07 18:25:36,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:25:36,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [21] total 24 [2019-12-07 18:25:36,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179909109] [2019-12-07 18:25:36,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:25:36,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:36,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:25:36,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-12-07 18:25:36,039 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand 7 states. [2019-12-07 18:25:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:36,136 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-12-07 18:25:36,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:25:36,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-12-07 18:25:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:36,137 INFO L225 Difference]: With dead ends: 120 [2019-12-07 18:25:36,137 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:25:36,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:25:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:25:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:25:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:25:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:25:36,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2019-12-07 18:25:36,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:36,138 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:25:36,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:25:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:25:36,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:25:36,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:36,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:25:36 BoogieIcfgContainer [2019-12-07 18:25:36,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:25:36,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:25:36,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:25:36,351 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:25:36,352 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:25:13" (3/4) ... [2019-12-07 18:25:36,359 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:25:36,372 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 18:25:36,373 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2019-12-07 18:25:36,373 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2019-12-07 18:25:36,373 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2019-12-07 18:25:36,373 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 18:25:36,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2019-12-07 18:25:36,381 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2019-12-07 18:25:36,381 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-07 18:25:36,381 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 18:25:36,382 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 18:25:36,414 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e98043dc-1735-4eac-a5e5-d8f9ff748604/bin/uautomizer/witness.graphml [2019-12-07 18:25:36,414 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:25:36,415 INFO L168 Benchmark]: Toolchain (without parser) took 22986.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.3 MB). Free memory was 941.4 MB in the beginning and 1.0 GB in the end (delta: -62.9 MB). Peak memory consumption was 267.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:25:36,415 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:25:36,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:25:36,415 INFO L168 Benchmark]: Boogie Preprocessor took 28.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:25:36,415 INFO L168 Benchmark]: RCFGBuilder took 259.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:25:36,416 INFO L168 Benchmark]: TraceAbstraction took 22426.70 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 283.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:25:36,416 INFO L168 Benchmark]: Witness Printer took 63.56 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:25:36,417 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 203.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 259.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22426.70 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 283.7 MB. Max. memory is 11.5 GB. * Witness Printer took 63.56 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 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: 22.3s, OverallIterations: 30, TraceHistogramMax: 10, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1311 SDtfs, 1650 SDslu, 6220 SDs, 0 SdLazy, 5392 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1704 GetRequests, 1214 SyntacticMatches, 76 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1753 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 121 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 2881 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2831 ConstructedInterpolants, 138 QuantifiedInterpolants, 1074369 SizeOfPredicates, 59 NumberOfNonLiveVariables, 4481 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 50 InterpolantComputations, 16 PerfectInterpolantSequences, 3369/4613 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...