./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i --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_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b66bca76c5a21a62f865fe4d9cdb8724001340a ........................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b66bca76c5a21a62f865fe4d9cdb8724001340a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:57:27,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:57:27,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:57:27,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:57:27,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:57:27,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:57:27,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:57:27,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:57:27,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:57:27,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:57:27,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:57:27,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:57:27,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:57:27,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:57:27,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:57:27,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:57:27,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:57:27,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:57:27,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:57:27,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:57:27,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:57:27,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:57:27,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:57:27,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:57:27,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:57:27,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:57:27,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:57:27,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:57:27,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:57:27,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:57:27,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:57:27,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:57:27,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:57:27,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:57:27,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:57:27,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:57:27,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:57:27,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:57:27,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:57:27,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:57:27,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:57:27,121 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 16:57:27,131 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:57:27,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:57:27,132 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:57:27,132 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:57:27,132 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:57:27,132 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:57:27,132 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:57:27,132 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:57:27,132 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:57:27,132 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:57:27,133 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:57:27,133 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:57:27,133 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:57:27,133 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:57:27,133 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:57:27,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:57:27,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:57:27,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:57:27,134 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:57:27,134 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:57:27,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:57:27,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:57:27,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:57:27,135 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 16:57:27,135 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 16:57:27,135 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 16:57:27,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:57:27,135 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:57:27,135 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:57:27,135 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:57:27,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:57:27,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:57:27,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:57:27,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:57:27,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:57:27,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:57:27,136 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:57:27,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:57:27,136 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:57:27,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:57:27,136 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan 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 -> Taipan 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 -> 9b66bca76c5a21a62f865fe4d9cdb8724001340a [2019-12-07 16:57:27,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:57:27,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:57:27,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:57:27,250 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:57:27,250 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:57:27,251 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2019-12-07 16:57:27,291 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/data/9f8e7a903/8ac11817a8374176a72bc816e3575376/FLAG696e507da [2019-12-07 16:57:27,741 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:57:27,742 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2019-12-07 16:57:27,751 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/data/9f8e7a903/8ac11817a8374176a72bc816e3575376/FLAG696e507da [2019-12-07 16:57:27,760 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/data/9f8e7a903/8ac11817a8374176a72bc816e3575376 [2019-12-07 16:57:27,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:57:27,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:57:27,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:57:27,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:57:27,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:57:27,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:57:27" (1/1) ... [2019-12-07 16:57:27,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:27, skipping insertion in model container [2019-12-07 16:57:27,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:57:27" (1/1) ... [2019-12-07 16:57:27,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:57:27,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:57:28,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:57:28,043 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-12-07 16:57:28,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@67d94234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:28, skipping insertion in model container [2019-12-07 16:57:28,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:57:28,044 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2019-12-07 16:57:28,047 INFO L168 Benchmark]: Toolchain (without parser) took 282.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:28,047 INFO L168 Benchmark]: CDTParser took 0.18 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 16:57:28,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:57:28,049 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.18 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 280.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 560]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 16:57:29,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:57:29,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:57:29,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:57:29,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:57:29,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:57:29,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:57:29,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:57:29,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:57:29,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:57:29,166 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:57:29,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:57:29,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:57:29,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:57:29,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:57:29,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:57:29,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:57:29,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:57:29,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:57:29,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:57:29,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:57:29,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:57:29,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:57:29,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:57:29,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:57:29,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:57:29,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:57:29,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:57:29,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:57:29,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:57:29,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:57:29,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:57:29,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:57:29,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:57:29,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:57:29,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:57:29,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:57:29,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:57:29,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:57:29,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:57:29,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:57:29,185 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 16:57:29,196 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:57:29,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:57:29,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:57:29,196 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:57:29,197 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:57:29,197 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:57:29,197 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:57:29,197 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:57:29,197 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:57:29,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:57:29,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:57:29,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:57:29,198 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:57:29,198 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:57:29,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:57:29,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:57:29,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:57:29,199 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 16:57:29,199 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 16:57:29,199 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 16:57:29,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:57:29,199 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:57:29,199 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 16:57:29,199 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 16:57:29,199 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:57:29,200 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:57:29,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:57:29,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:57:29,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:57:29,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:57:29,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:57:29,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:57:29,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:57:29,201 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 16:57:29,201 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 16:57:29,201 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:57:29,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:57:29,201 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan 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 -> Taipan 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 -> 9b66bca76c5a21a62f865fe4d9cdb8724001340a [2019-12-07 16:57:29,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:57:29,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:57:29,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:57:29,386 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:57:29,386 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:57:29,387 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2019-12-07 16:57:29,430 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/data/950fb98ec/aaa57cd36a884dfcadedc25d360f1a74/FLAG81d22b92d [2019-12-07 16:57:29,796 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:57:29,796 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2019-12-07 16:57:29,807 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/data/950fb98ec/aaa57cd36a884dfcadedc25d360f1a74/FLAG81d22b92d [2019-12-07 16:57:29,816 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/data/950fb98ec/aaa57cd36a884dfcadedc25d360f1a74 [2019-12-07 16:57:29,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:57:29,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:57:29,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:57:29,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:57:29,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:57:29,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:57:29" (1/1) ... [2019-12-07 16:57:29,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7f73ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:29, skipping insertion in model container [2019-12-07 16:57:29,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:57:29" (1/1) ... [2019-12-07 16:57:29,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:57:29,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:57:30,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:57:30,077 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 16:57:30,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:57:30,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:57:30,115 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:57:30,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:57:30,180 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:57:30,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:30 WrapperNode [2019-12-07 16:57:30,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:57:30,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:57:30,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:57:30,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:57:30,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:30" (1/1) ... [2019-12-07 16:57:30,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:30" (1/1) ... [2019-12-07 16:57:30,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:57:30,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:57:30,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:57:30,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:57:30,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:30" (1/1) ... [2019-12-07 16:57:30,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:30" (1/1) ... [2019-12-07 16:57:30,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:30" (1/1) ... [2019-12-07 16:57:30,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:30" (1/1) ... [2019-12-07 16:57:30,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:30" (1/1) ... [2019-12-07 16:57:30,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:30" (1/1) ... [2019-12-07 16:57:30,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:30" (1/1) ... [2019-12-07 16:57:30,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:57:30,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:57:30,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:57:30,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:57:30,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/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 16:57:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 16:57:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:57:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 16:57:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 16:57:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:57:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:57:30,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:57:30,805 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:57:30,805 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:57:30,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:57:30 BoogieIcfgContainer [2019-12-07 16:57:30,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:57:30,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:57:30,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:57:30,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:57:30,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:57:29" (1/3) ... [2019-12-07 16:57:30,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99eb46b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:57:30, skipping insertion in model container [2019-12-07 16:57:30,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:57:30" (2/3) ... [2019-12-07 16:57:30,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99eb46b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:57:30, skipping insertion in model container [2019-12-07 16:57:30,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:57:30" (3/3) ... [2019-12-07 16:57:30,813 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_dsw.i [2019-12-07 16:57:30,821 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:57:30,826 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 77 error locations. [2019-12-07 16:57:30,833 INFO L249 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2019-12-07 16:57:30,845 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:57:30,846 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 16:57:30,846 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:57:30,846 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:57:30,846 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:57:30,846 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:57:30,846 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:57:30,846 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:57:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-12-07 16:57:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 16:57:30,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:30,866 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 16:57:30,867 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:30,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-12-07 16:57:30,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:30,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250954871] [2019-12-07 16:57:30,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:30,937 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:57:30,942 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:30,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:30,998 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:31,004 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:31,004 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:31,005 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:57:31,013 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 16:57:31,014 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:31,017 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 16:57:31,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250954871] [2019-12-07 16:57:31,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:31,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 16:57:31,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717595791] [2019-12-07 16:57:31,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:57:31,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:31,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:57:31,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:57:31,034 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 3 states. [2019-12-07 16:57:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:31,283 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2019-12-07 16:57:31,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:57:31,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 16:57:31,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:31,292 INFO L225 Difference]: With dead ends: 167 [2019-12-07 16:57:31,292 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 16:57:31,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:57:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 16:57:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2019-12-07 16:57:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 16:57:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2019-12-07 16:57:31,326 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 3 [2019-12-07 16:57:31,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:31,326 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2019-12-07 16:57:31,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:57:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2019-12-07 16:57:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 16:57:31,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:31,326 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 16:57:31,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 16:57:31,527 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:31,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:31,528 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-12-07 16:57:31,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:31,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648809720] [2019-12-07 16:57:31,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:31,565 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:57:31,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:31,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:31,575 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:31,581 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:31,582 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:31,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 16:57:31,589 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 16:57:31,589 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:31,622 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 16:57:31,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648809720] [2019-12-07 16:57:31,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:31,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 16:57:31,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573270265] [2019-12-07 16:57:31,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:31,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:31,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:31,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:31,624 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 4 states. [2019-12-07 16:57:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:31,892 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2019-12-07 16:57:31,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:57:31,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 16:57:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:31,894 INFO L225 Difference]: With dead ends: 147 [2019-12-07 16:57:31,894 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 16:57:31,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 16:57:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-12-07 16:57:31,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 16:57:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2019-12-07 16:57:31,902 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 3 [2019-12-07 16:57:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:31,902 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2019-12-07 16:57:31,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:31,903 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2019-12-07 16:57:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 16:57:31,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:31,903 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 16:57:32,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 16:57:32,104 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:32,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:32,105 INFO L82 PathProgramCache]: Analyzing trace with hash 889446412, now seen corresponding path program 1 times [2019-12-07 16:57:32,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:32,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459562238] [2019-12-07 16:57:32,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:32,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:57:32,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:32,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:32,152 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:32,154 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:32,154 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:32,154 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:57:32,164 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 16:57:32,164 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:32,171 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 16:57:32,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459562238] [2019-12-07 16:57:32,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:32,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 16:57:32,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880721161] [2019-12-07 16:57:32,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:32,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:32,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:32,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:32,173 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 4 states. [2019-12-07 16:57:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:32,547 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2019-12-07 16:57:32,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:57:32,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 16:57:32,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:32,549 INFO L225 Difference]: With dead ends: 157 [2019-12-07 16:57:32,549 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 16:57:32,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 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 16:57:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 16:57:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 132. [2019-12-07 16:57:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 16:57:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2019-12-07 16:57:32,556 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 6 [2019-12-07 16:57:32,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:32,557 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2019-12-07 16:57:32,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:32,557 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2019-12-07 16:57:32,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 16:57:32,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:32,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 16:57:32,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 16:57:32,760 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:32,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:32,761 INFO L82 PathProgramCache]: Analyzing trace with hash 889446413, now seen corresponding path program 1 times [2019-12-07 16:57:32,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:32,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976830430] [2019-12-07 16:57:32,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:32,806 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:57:32,807 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:32,814 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:32,814 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:32,820 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:32,820 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:32,820 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 16:57:32,834 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 16:57:32,834 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:32,891 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 16:57:32,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976830430] [2019-12-07 16:57:32,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:32,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 16:57:32,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407099489] [2019-12-07 16:57:32,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:57:32,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:32,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:57:32,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:57:32,892 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand 6 states. [2019-12-07 16:57:33,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:33,631 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2019-12-07 16:57:33,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:57:33,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-12-07 16:57:33,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:33,634 INFO L225 Difference]: With dead ends: 195 [2019-12-07 16:57:33,634 INFO L226 Difference]: Without dead ends: 195 [2019-12-07 16:57:33,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:57:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-07 16:57:33,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 155. [2019-12-07 16:57:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 16:57:33,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2019-12-07 16:57:33,643 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 6 [2019-12-07 16:57:33,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:33,644 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2019-12-07 16:57:33,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:57:33,644 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2019-12-07 16:57:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:57:33,645 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:33,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:33,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 16:57:33,847 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:33,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:33,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1845765106, now seen corresponding path program 1 times [2019-12-07 16:57:33,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:33,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842072978] [2019-12-07 16:57:33,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:33,975 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:57:33,976 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:33,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:33,980 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:33,982 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:33,982 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:33,982 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:57:33,995 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:33,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 16:57:33,997 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:33,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:33,999 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:34,000 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2019-12-07 16:57:34,004 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 16:57:34,004 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:34,009 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 16:57:34,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842072978] [2019-12-07 16:57:34,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:34,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:57:34,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298691023] [2019-12-07 16:57:34,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:34,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:34,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:34,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:34,011 INFO L87 Difference]: Start difference. First operand 155 states and 178 transitions. Second operand 4 states. [2019-12-07 16:57:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:34,381 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2019-12-07 16:57:34,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:57:34,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 16:57:34,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:34,383 INFO L225 Difference]: With dead ends: 172 [2019-12-07 16:57:34,384 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 16:57:34,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 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 16:57:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 16:57:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-12-07 16:57:34,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 16:57:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2019-12-07 16:57:34,393 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 9 [2019-12-07 16:57:34,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:34,393 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2019-12-07 16:57:34,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2019-12-07 16:57:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:57:34,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:34,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:34,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 16:57:34,596 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1772597097, now seen corresponding path program 1 times [2019-12-07 16:57:34,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:34,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723699056] [2019-12-07 16:57:34,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:34,718 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:57:34,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:34,725 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:34,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723699056] [2019-12-07 16:57:34,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:34,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 16:57:34,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366725575] [2019-12-07 16:57:34,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:57:34,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:34,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:57:34,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:57:34,727 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand 3 states. [2019-12-07 16:57:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:34,740 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2019-12-07 16:57:34,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:57:34,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 16:57:34,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:34,741 INFO L225 Difference]: With dead ends: 157 [2019-12-07 16:57:34,741 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 16:57:34,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:57:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 16:57:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-12-07 16:57:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 16:57:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2019-12-07 16:57:34,747 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 13 [2019-12-07 16:57:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:34,748 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2019-12-07 16:57:34,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:57:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2019-12-07 16:57:34,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:57:34,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:34,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:34,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 16:57:34,950 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:34,951 INFO L82 PathProgramCache]: Analyzing trace with hash 835517517, now seen corresponding path program 1 times [2019-12-07 16:57:34,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:34,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158644752] [2019-12-07 16:57:34,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:34,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:57:34,997 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:35,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:35,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:35,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:35,003 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:35,003 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:57:35,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:57:35,011 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:35,016 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:35,016 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:35,017 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-12-07 16:57:35,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-12-07 16:57:35,025 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:35,027 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:35,027 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:35,027 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 16:57:35,032 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 16:57:35,033 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:35,039 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 16:57:35,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158644752] [2019-12-07 16:57:35,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:35,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:57:35,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210521603] [2019-12-07 16:57:35,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:57:35,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:35,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:57:35,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:57:35,040 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand 5 states. [2019-12-07 16:57:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:35,640 INFO L93 Difference]: Finished difference Result 258 states and 296 transitions. [2019-12-07 16:57:35,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:57:35,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 16:57:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:35,642 INFO L225 Difference]: With dead ends: 258 [2019-12-07 16:57:35,642 INFO L226 Difference]: Without dead ends: 258 [2019-12-07 16:57:35,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:57:35,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-07 16:57:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 156. [2019-12-07 16:57:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-07 16:57:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2019-12-07 16:57:35,647 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 14 [2019-12-07 16:57:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:35,647 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2019-12-07 16:57:35,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:57:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2019-12-07 16:57:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:57:35,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:35,648 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:35,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 16:57:35,850 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:35,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:35,850 INFO L82 PathProgramCache]: Analyzing trace with hash 835517518, now seen corresponding path program 1 times [2019-12-07 16:57:35,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:35,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085436882] [2019-12-07 16:57:35,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:35,952 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:57:35,953 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:35,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:35,957 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:35,961 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:35,961 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:35,961 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 16:57:35,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:57:35,974 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:35,983 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:35,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:57:35,987 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:35,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:35,994 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:35,995 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2019-12-07 16:57:36,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 16:57:36,010 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:36,016 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:36,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 16:57:36,018 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:36,022 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:36,022 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:36,022 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2019-12-07 16:57:36,030 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 16:57:36,030 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:36,162 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 16:57:36,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085436882] [2019-12-07 16:57:36,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:36,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 16:57:36,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824286844] [2019-12-07 16:57:36,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:57:36,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:36,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:57:36,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:57:36,163 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand 8 states. [2019-12-07 16:57:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:37,976 INFO L93 Difference]: Finished difference Result 289 states and 327 transitions. [2019-12-07 16:57:37,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:57:37,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-07 16:57:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:37,978 INFO L225 Difference]: With dead ends: 289 [2019-12-07 16:57:37,978 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 16:57:37,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:57:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 16:57:37,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 155. [2019-12-07 16:57:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 16:57:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 175 transitions. [2019-12-07 16:57:37,982 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 175 transitions. Word has length 14 [2019-12-07 16:57:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:37,982 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 175 transitions. [2019-12-07 16:57:37,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:57:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 175 transitions. [2019-12-07 16:57:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:57:37,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:37,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:38,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 16:57:38,184 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1899349350, now seen corresponding path program 1 times [2019-12-07 16:57:38,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:38,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47531794] [2019-12-07 16:57:38,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:38,293 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:57:38,295 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:38,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:57:38,302 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:38,312 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:38,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:57:38,316 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:38,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:38,323 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:38,323 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-12-07 16:57:38,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 16:57:38,355 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:38,365 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:38,367 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 16:57:38,367 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:38,370 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:38,370 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:38,371 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-12-07 16:57:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:38,390 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:38,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:38,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47531794] [2019-12-07 16:57:38,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:38,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 16:57:38,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670227782] [2019-12-07 16:57:38,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:57:38,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:38,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:57:38,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:57:38,397 INFO L87 Difference]: Start difference. First operand 155 states and 175 transitions. Second operand 6 states. [2019-12-07 16:57:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:38,933 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2019-12-07 16:57:38,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:57:38,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 16:57:38,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:38,935 INFO L225 Difference]: With dead ends: 192 [2019-12-07 16:57:38,935 INFO L226 Difference]: Without dead ends: 192 [2019-12-07 16:57:38,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:57:38,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-12-07 16:57:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 166. [2019-12-07 16:57:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-12-07 16:57:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 190 transitions. [2019-12-07 16:57:38,938 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 190 transitions. Word has length 15 [2019-12-07 16:57:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:38,938 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 190 transitions. [2019-12-07 16:57:38,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:57:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 190 transitions. [2019-12-07 16:57:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:57:38,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:38,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:39,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 16:57:39,141 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:39,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:39,142 INFO L82 PathProgramCache]: Analyzing trace with hash 336550415, now seen corresponding path program 1 times [2019-12-07 16:57:39,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:39,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362036434] [2019-12-07 16:57:39,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:39,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:57:39,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:39,196 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:39,196 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:39,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:39,198 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:39,198 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:57:39,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:57:39,205 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:39,214 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:39,214 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:39,214 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 16:57:39,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-12-07 16:57:39,225 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:39,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:39,227 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:39,227 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-12-07 16:57:39,233 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 16:57:39,233 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:39,235 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 16:57:39,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362036434] [2019-12-07 16:57:39,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:39,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:57:39,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778325197] [2019-12-07 16:57:39,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:57:39,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:39,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:57:39,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:57:39,236 INFO L87 Difference]: Start difference. First operand 166 states and 190 transitions. Second operand 5 states. [2019-12-07 16:57:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:39,879 INFO L93 Difference]: Finished difference Result 265 states and 305 transitions. [2019-12-07 16:57:39,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:57:39,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 16:57:39,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:39,881 INFO L225 Difference]: With dead ends: 265 [2019-12-07 16:57:39,881 INFO L226 Difference]: Without dead ends: 265 [2019-12-07 16:57:39,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:57:39,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-12-07 16:57:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 165. [2019-12-07 16:57:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 16:57:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2019-12-07 16:57:39,886 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 16 [2019-12-07 16:57:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:39,887 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2019-12-07 16:57:39,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:57:39,887 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2019-12-07 16:57:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:57:39,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:39,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:40,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 16:57:40,089 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:40,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:40,090 INFO L82 PathProgramCache]: Analyzing trace with hash 336550416, now seen corresponding path program 1 times [2019-12-07 16:57:40,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:40,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523606019] [2019-12-07 16:57:40,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:40,143 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:57:40,144 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:40,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:40,148 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,151 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,152 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,152 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 16:57:40,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:57:40,162 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,175 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:57:40,175 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,184 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,184 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,184 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-12-07 16:57:40,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-12-07 16:57:40,202 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 16:57:40,212 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:40,216 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:40,216 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2019-12-07 16:57:40,225 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 16:57:40,225 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:40,335 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 16:57:40,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523606019] [2019-12-07 16:57:40,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:40,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 16:57:40,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852351891] [2019-12-07 16:57:40,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:57:40,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:40,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:57:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:57:40,336 INFO L87 Difference]: Start difference. First operand 165 states and 188 transitions. Second operand 8 states. [2019-12-07 16:57:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:42,259 INFO L93 Difference]: Finished difference Result 296 states and 336 transitions. [2019-12-07 16:57:42,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:57:42,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 16:57:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:42,261 INFO L225 Difference]: With dead ends: 296 [2019-12-07 16:57:42,261 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 16:57:42,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:57:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 16:57:42,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 164. [2019-12-07 16:57:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 16:57:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2019-12-07 16:57:42,265 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 16 [2019-12-07 16:57:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:42,265 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2019-12-07 16:57:42,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:57:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2019-12-07 16:57:42,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:57:42,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:42,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:42,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 16:57:42,467 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:42,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1566911361, now seen corresponding path program 1 times [2019-12-07 16:57:42,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:42,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539106697] [2019-12-07 16:57:42,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:42,522 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:57:42,523 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:42,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:42,526 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:42,527 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:42,527 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:42,528 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:57:42,548 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:42,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 16:57:42,549 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:42,563 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 16:57:42,563 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:42,563 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-12-07 16:57:42,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:57:42,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:42,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:42,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:42,586 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-12-07 16:57:42,634 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:42,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 53 [2019-12-07 16:57:42,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:42,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:42,636 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 16:57:42,664 INFO L614 ElimStorePlain]: treesize reduction 75, result has 33.6 percent of original size [2019-12-07 16:57:42,665 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:42,665 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2019-12-07 16:57:42,700 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:42,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2019-12-07 16:57:42,701 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:42,712 INFO L614 ElimStorePlain]: treesize reduction 12, result has 58.6 percent of original size [2019-12-07 16:57:42,713 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:42,713 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:17 [2019-12-07 16:57:42,729 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 16:57:42,729 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:42,811 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:42,829 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:42,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:42,830 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 16:57:42,830 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2019-12-07 16:57:42,889 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 16:57:42,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539106697] [2019-12-07 16:57:42,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:42,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-12-07 16:57:42,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887136615] [2019-12-07 16:57:42,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 16:57:42,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:42,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 16:57:42,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:57:42,890 INFO L87 Difference]: Start difference. First operand 164 states and 186 transitions. Second operand 16 states. [2019-12-07 16:57:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:44,079 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2019-12-07 16:57:44,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:57:44,080 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-07 16:57:44,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:44,081 INFO L225 Difference]: With dead ends: 206 [2019-12-07 16:57:44,081 INFO L226 Difference]: Without dead ends: 206 [2019-12-07 16:57:44,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2019-12-07 16:57:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-07 16:57:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 163. [2019-12-07 16:57:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 16:57:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2019-12-07 16:57:44,084 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 17 [2019-12-07 16:57:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:44,084 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2019-12-07 16:57:44,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 16:57:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2019-12-07 16:57:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:57:44,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:44,085 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:44,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 16:57:44,286 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:44,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:44,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1566911362, now seen corresponding path program 1 times [2019-12-07 16:57:44,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:44,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196134657] [2019-12-07 16:57:44,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:44,378 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 16:57:44,380 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:44,385 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:44,386 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:44,387 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:44,387 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:44,387 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:57:44,395 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_101|], 1=[|v_#valid_118|]} [2019-12-07 16:57:44,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:44,397 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:44,404 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:44,409 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:44,409 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 16:57:44,410 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:44,414 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:44,415 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:44,415 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-12-07 16:57:44,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:57:44,429 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:44,439 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:44,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:57:44,442 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:44,450 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:44,450 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:44,450 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:25 [2019-12-07 16:57:44,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-12-07 16:57:44,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:44,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:44,534 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:44,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 58 [2019-12-07 16:57:44,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:44,535 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:44,557 INFO L614 ElimStorePlain]: treesize reduction 20, result has 70.1 percent of original size [2019-12-07 16:57:44,558 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:44,558 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2019-12-07 16:57:44,601 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:44,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2019-12-07 16:57:44,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:44,632 INFO L614 ElimStorePlain]: treesize reduction 12, result has 73.3 percent of original size [2019-12-07 16:57:44,634 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 16:57:44,635 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:44,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:44,640 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:44,640 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:11 [2019-12-07 16:57:44,655 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 16:57:44,655 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:45,310 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:45,401 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:45,409 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:45,568 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-12-07 16:57:45,569 INFO L614 ElimStorePlain]: treesize reduction 48, result has 66.2 percent of original size [2019-12-07 16:57:45,574 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:45,688 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-12-07 16:57:45,689 INFO L614 ElimStorePlain]: treesize reduction 10, result has 82.1 percent of original size [2019-12-07 16:57:45,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:45,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:45,690 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 16:57:45,690 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:127, output treesize:49 [2019-12-07 16:57:45,836 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-12-07 16:57:45,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:45,840 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:45,841 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:45,841 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-12-07 16:57:45,889 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 16:57:45,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196134657] [2019-12-07 16:57:45,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:45,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-12-07 16:57:45,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515484336] [2019-12-07 16:57:45,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 16:57:45,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:45,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 16:57:45,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:57:45,890 INFO L87 Difference]: Start difference. First operand 163 states and 184 transitions. Second operand 16 states. [2019-12-07 16:57:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:49,297 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2019-12-07 16:57:49,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:57:49,298 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-07 16:57:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:49,299 INFO L225 Difference]: With dead ends: 204 [2019-12-07 16:57:49,299 INFO L226 Difference]: Without dead ends: 204 [2019-12-07 16:57:49,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2019-12-07 16:57:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-12-07 16:57:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 162. [2019-12-07 16:57:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-07 16:57:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 182 transitions. [2019-12-07 16:57:49,303 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 182 transitions. Word has length 17 [2019-12-07 16:57:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:49,303 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 182 transitions. [2019-12-07 16:57:49,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 16:57:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 182 transitions. [2019-12-07 16:57:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:57:49,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:49,304 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:49,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 16:57:49,505 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:49,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:49,506 INFO L82 PathProgramCache]: Analyzing trace with hash -574900066, now seen corresponding path program 1 times [2019-12-07 16:57:49,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:49,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552470238] [2019-12-07 16:57:49,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:49,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:57:49,627 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:49,636 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:49,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552470238] [2019-12-07 16:57:49,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:49,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 16:57:49,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861124981] [2019-12-07 16:57:49,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:57:49,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:49,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:57:49,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:57:49,641 INFO L87 Difference]: Start difference. First operand 162 states and 182 transitions. Second operand 4 states. [2019-12-07 16:57:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:49,998 INFO L93 Difference]: Finished difference Result 202 states and 226 transitions. [2019-12-07 16:57:49,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:57:49,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 16:57:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:50,000 INFO L225 Difference]: With dead ends: 202 [2019-12-07 16:57:50,000 INFO L226 Difference]: Without dead ends: 202 [2019-12-07 16:57:50,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 2 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 16:57:50,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-12-07 16:57:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 164. [2019-12-07 16:57:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 16:57:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2019-12-07 16:57:50,003 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 17 [2019-12-07 16:57:50,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:50,003 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2019-12-07 16:57:50,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:57:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2019-12-07 16:57:50,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:57:50,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:50,004 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:50,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 16:57:50,204 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:50,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:50,205 INFO L82 PathProgramCache]: Analyzing trace with hash -574900065, now seen corresponding path program 1 times [2019-12-07 16:57:50,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:50,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242019296] [2019-12-07 16:57:50,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:50,287 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 16:57:50,288 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:50,326 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:50,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:50,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 16:57:50,406 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:50,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 16:57:50,419 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:50,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:50,449 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 16:57:50,450 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-12-07 16:57:50,618 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 16:57:50,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242019296] [2019-12-07 16:57:50,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:57:50,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-12-07 16:57:50,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934255534] [2019-12-07 16:57:50,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:57:50,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:50,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:57:50,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:57:50,619 INFO L87 Difference]: Start difference. First operand 164 states and 186 transitions. Second operand 6 states. [2019-12-07 16:57:51,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:51,501 INFO L93 Difference]: Finished difference Result 274 states and 307 transitions. [2019-12-07 16:57:51,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:57:51,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-07 16:57:51,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:51,504 INFO L225 Difference]: With dead ends: 274 [2019-12-07 16:57:51,504 INFO L226 Difference]: Without dead ends: 274 [2019-12-07 16:57:51,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:57:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-12-07 16:57:51,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 167. [2019-12-07 16:57:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-12-07 16:57:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 191 transitions. [2019-12-07 16:57:51,508 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 191 transitions. Word has length 17 [2019-12-07 16:57:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:51,509 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 191 transitions. [2019-12-07 16:57:51,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:57:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 191 transitions. [2019-12-07 16:57:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:57:51,509 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:51,509 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:51,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 16:57:51,710 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:51,711 INFO L82 PathProgramCache]: Analyzing trace with hash -574898144, now seen corresponding path program 1 times [2019-12-07 16:57:51,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:51,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740737384] [2019-12-07 16:57:51,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:51,848 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 16:57:51,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:51,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:57:51,856 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:51,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:51,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:57:51,867 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:51,872 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:51,872 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:51,873 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-12-07 16:57:51,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:51,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:57:51,886 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:51,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:51,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:57:51,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:57:51,903 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:51,912 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:51,912 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:51,912 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 16:57:51,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 16:57:51,947 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:51,955 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:51,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:51,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 16:57:51,957 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:51,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:51,960 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:51,960 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-12-07 16:57:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:51,994 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:52,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740737384] [2019-12-07 16:57:52,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:52,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 11 [2019-12-07 16:57:52,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447118196] [2019-12-07 16:57:52,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:57:52,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:52,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:57:52,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:57:52,039 INFO L87 Difference]: Start difference. First operand 167 states and 191 transitions. Second operand 11 states. [2019-12-07 16:57:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:53,075 INFO L93 Difference]: Finished difference Result 337 states and 379 transitions. [2019-12-07 16:57:53,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 16:57:53,076 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-12-07 16:57:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:53,077 INFO L225 Difference]: With dead ends: 337 [2019-12-07 16:57:53,077 INFO L226 Difference]: Without dead ends: 337 [2019-12-07 16:57:53,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-12-07 16:57:53,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-12-07 16:57:53,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 214. [2019-12-07 16:57:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-07 16:57:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2019-12-07 16:57:53,081 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 17 [2019-12-07 16:57:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:53,081 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2019-12-07 16:57:53,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:57:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2019-12-07 16:57:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:57:53,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:53,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:53,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 16:57:53,282 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:53,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:53,283 INFO L82 PathProgramCache]: Analyzing trace with hash -642033858, now seen corresponding path program 1 times [2019-12-07 16:57:53,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:53,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729305457] [2019-12-07 16:57:53,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:53,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:57:53,331 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:53,354 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:57:53,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729305457] [2019-12-07 16:57:53,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [118315827] [2019-12-07 16:57:53,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:57:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:53,422 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:57:53,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:53,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 16:57:53,486 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 16:57:53,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:57:53,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6, 6] total 11 [2019-12-07 16:57:53,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128789190] [2019-12-07 16:57:53,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:57:53,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:53,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:57:53,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:57:53,513 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand 8 states. [2019-12-07 16:57:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:54,133 INFO L93 Difference]: Finished difference Result 300 states and 347 transitions. [2019-12-07 16:57:54,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:57:54,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-07 16:57:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:54,134 INFO L225 Difference]: With dead ends: 300 [2019-12-07 16:57:54,134 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 16:57:54,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:57:54,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 16:57:54,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 213. [2019-12-07 16:57:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-07 16:57:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 254 transitions. [2019-12-07 16:57:54,138 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 254 transitions. Word has length 18 [2019-12-07 16:57:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:54,138 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 254 transitions. [2019-12-07 16:57:54,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:57:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 254 transitions. [2019-12-07 16:57:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:57:54,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:54,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:54,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3,19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:57:54,539 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:54,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:54,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1719812953, now seen corresponding path program 1 times [2019-12-07 16:57:54,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:54,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134154787] [2019-12-07 16:57:54,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:54,595 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:57:54,596 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:54,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:54,599 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:54,600 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:54,600 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:54,601 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:57:54,622 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:54,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 16:57:54,622 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:54,635 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 16:57:54,636 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:54,636 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-12-07 16:57:54,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:57:54,648 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:54,658 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:54,658 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:54,658 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-12-07 16:57:54,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:54,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 59 [2019-12-07 16:57:54,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:54,759 INFO L614 ElimStorePlain]: treesize reduction 26, result has 61.8 percent of original size [2019-12-07 16:57:54,760 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:54,760 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:42 [2019-12-07 16:57:54,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:54,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 33 [2019-12-07 16:57:54,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:54,818 INFO L614 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-12-07 16:57:54,818 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:54,818 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:17 [2019-12-07 16:57:54,836 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 16:57:54,836 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:54,955 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:54,974 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:54,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:54,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:54,975 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 16:57:54,975 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:36 [2019-12-07 16:57:55,040 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 16:57:55,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134154787] [2019-12-07 16:57:55,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:55,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-12-07 16:57:55,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107128506] [2019-12-07 16:57:55,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 16:57:55,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:55,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 16:57:55,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:57:55,041 INFO L87 Difference]: Start difference. First operand 213 states and 254 transitions. Second operand 16 states. [2019-12-07 16:57:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:57:56,368 INFO L93 Difference]: Finished difference Result 237 states and 281 transitions. [2019-12-07 16:57:56,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:57:56,368 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-12-07 16:57:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:57:56,369 INFO L225 Difference]: With dead ends: 237 [2019-12-07 16:57:56,369 INFO L226 Difference]: Without dead ends: 237 [2019-12-07 16:57:56,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2019-12-07 16:57:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-12-07 16:57:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 212. [2019-12-07 16:57:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-07 16:57:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2019-12-07 16:57:56,372 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 19 [2019-12-07 16:57:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:57:56,372 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2019-12-07 16:57:56,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 16:57:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2019-12-07 16:57:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:57:56,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:57:56,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:57:56,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 16:57:56,574 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:57:56,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:57:56,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1719812954, now seen corresponding path program 1 times [2019-12-07 16:57:56,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:57:56,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11952492] [2019-12-07 16:57:56,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 16:57:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:57:56,682 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 16:57:56,683 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:57:56,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:56,686 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:56,687 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:56,688 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:56,688 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:57:56,694 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_113|], 1=[|v_#valid_133|]} [2019-12-07 16:57:56,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:57:56,697 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:56,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:56,708 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:56,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 16:57:56,709 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:56,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:56,714 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:56,714 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-12-07 16:57:56,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:57:56,728 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:56,740 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:56,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:57:56,744 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:56,757 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:56,758 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:56,758 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-12-07 16:57:56,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:56,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 70 [2019-12-07 16:57:56,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:56,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:56,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 16:57:56,892 INFO L614 ElimStorePlain]: treesize reduction 133, result has 33.5 percent of original size [2019-12-07 16:57:56,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-12-07 16:57:56,896 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:56,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:56,911 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:57:56,911 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:57 [2019-12-07 16:57:56,962 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:56,962 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 40 [2019-12-07 16:57:56,963 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:57,000 INFO L614 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-12-07 16:57:57,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-12-07 16:57:57,003 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:57,009 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:57,009 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:57,009 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:9 [2019-12-07 16:57:57,024 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 16:57:57,025 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:57:57,853 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:57,990 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-12-07 16:57:57,991 INFO L614 ElimStorePlain]: treesize reduction 12, result has 88.6 percent of original size [2019-12-07 16:57:57,996 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:58,089 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:58,094 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:58,250 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-12-07 16:57:58,251 INFO L614 ElimStorePlain]: treesize reduction 56, result has 48.1 percent of original size [2019-12-07 16:57:58,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:57:58,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:57:58,252 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 16:57:58,252 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:151, output treesize:49 [2019-12-07 16:57:58,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-12-07 16:57:58,364 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:57:58,367 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:57:58,367 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:57:58,367 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-12-07 16:57:58,417 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 16:57:58,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11952492] [2019-12-07 16:57:58,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:57:58,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-12-07 16:57:58,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794247005] [2019-12-07 16:57:58,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 16:57:58,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:57:58,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 16:57:58,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:57:58,418 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand 16 states. [2019-12-07 16:58:00,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:58:00,402 INFO L93 Difference]: Finished difference Result 235 states and 278 transitions. [2019-12-07 16:58:00,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:58:00,403 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-12-07 16:58:00,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:58:00,404 INFO L225 Difference]: With dead ends: 235 [2019-12-07 16:58:00,404 INFO L226 Difference]: Without dead ends: 235 [2019-12-07 16:58:00,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2019-12-07 16:58:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-12-07 16:58:00,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 211. [2019-12-07 16:58:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-12-07 16:58:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 250 transitions. [2019-12-07 16:58:00,407 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 250 transitions. Word has length 19 [2019-12-07 16:58:00,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:58:00,407 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 250 transitions. [2019-12-07 16:58:00,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 16:58:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 250 transitions. [2019-12-07 16:58:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 16:58:00,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:58:00,407 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:58:00,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 16:58:00,608 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:58:00,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:58:00,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1222698860, now seen corresponding path program 1 times [2019-12-07 16:58:00,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:58:00,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104705749] [2019-12-07 16:58:00,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 16:58:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:00,739 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 16:58:00,740 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:00,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:58:00,746 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:00,754 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:00,756 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:58:00,757 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:00,769 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:00,769 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:00,769 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-12-07 16:58:00,809 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:58:00,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:58:00,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-12-07 16:58:00,811 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:00,824 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:00,827 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:58:00,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:58:00,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-12-07 16:58:00,829 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:00,839 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:00,839 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:00,839 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:42 [2019-12-07 16:58:00,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:58:00,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 16:58:00,865 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:00,885 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:00,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:58:00,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-12-07 16:58:00,889 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:00,900 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:00,901 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:00,901 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:18 [2019-12-07 16:58:00,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 16:58:00,938 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:00,943 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:00,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 16:58:00,944 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:00,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:00,947 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:00,948 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-12-07 16:58:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:00,993 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:58:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:01,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104705749] [2019-12-07 16:58:01,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [47581827] [2019-12-07 16:58:01,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:58:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:01,280 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 16:58:01,281 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:01,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:58:01,286 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:58:01,298 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,305 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,305 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-12-07 16:58:01,311 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:58:01,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:58:01,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-12-07 16:58:01,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,327 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,329 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:58:01,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:58:01,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-12-07 16:58:01,331 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,340 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,340 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,340 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:36 [2019-12-07 16:58:01,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:58:01,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 16:58:01,365 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:58:01,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-12-07 16:58:01,389 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,399 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,400 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,400 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:18 [2019-12-07 16:58:01,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 16:58:01,414 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 16:58:01,422 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,425 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,425 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-12-07 16:58:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:01,428 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:58:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:01,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105857799] [2019-12-07 16:58:01,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:58:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:01,528 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 16:58:01,529 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:01,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:58:01,534 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:58:01,545 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,551 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,552 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-12-07 16:58:01,557 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:58:01,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:58:01,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-12-07 16:58:01,559 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,575 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,577 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:58:01,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:58:01,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-12-07 16:58:01,579 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,589 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,589 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,589 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:40 [2019-12-07 16:58:01,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:58:01,609 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 16:58:01,609 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:58:01,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-12-07 16:58:01,630 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,642 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,642 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:18 [2019-12-07 16:58:01,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 16:58:01,667 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,672 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,673 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 16:58:01,673 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,677 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:01,677 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:01,677 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-12-07 16:58:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:01,680 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:58:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:01,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 16:58:01,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12, 10, 12, 10] total 17 [2019-12-07 16:58:01,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125465741] [2019-12-07 16:58:01,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 16:58:01,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:58:01,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 16:58:01,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-07 16:58:01,705 INFO L87 Difference]: Start difference. First operand 211 states and 250 transitions. Second operand 17 states. [2019-12-07 16:58:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:58:03,097 INFO L93 Difference]: Finished difference Result 328 states and 383 transitions. [2019-12-07 16:58:03,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 16:58:03,097 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-12-07 16:58:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:58:03,099 INFO L225 Difference]: With dead ends: 328 [2019-12-07 16:58:03,099 INFO L226 Difference]: Without dead ends: 328 [2019-12-07 16:58:03,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 126 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2019-12-07 16:58:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-07 16:58:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 268. [2019-12-07 16:58:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-12-07 16:58:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 324 transitions. [2019-12-07 16:58:03,104 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 324 transitions. Word has length 26 [2019-12-07 16:58:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:58:03,104 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 324 transitions. [2019-12-07 16:58:03,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 16:58:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 324 transitions. [2019-12-07 16:58:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 16:58:03,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:58:03,105 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:58:03,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:58:03,707 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:58:03,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:58:03,708 INFO L82 PathProgramCache]: Analyzing trace with hash 446189166, now seen corresponding path program 1 times [2019-12-07 16:58:03,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:58:03,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001342702] [2019-12-07 16:58:03,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 16:58:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:03,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 16:58:03,822 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:03,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:58:03,825 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:03,826 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:03,826 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:03,826 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:58:03,851 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:03,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 16:58:03,852 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:03,873 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 16:58:03,873 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:03,874 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 16:58:03,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:58:03,890 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:03,904 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:03,904 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:03,905 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2019-12-07 16:58:03,975 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:03,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 59 [2019-12-07 16:58:03,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:03,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:03,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:03,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 16:58:04,043 INFO L614 ElimStorePlain]: treesize reduction 145, result has 24.9 percent of original size [2019-12-07 16:58:04,043 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:58:04,043 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2019-12-07 16:58:04,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:04,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 111 [2019-12-07 16:58:04,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:04,178 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:04,224 INFO L614 ElimStorePlain]: treesize reduction 80, result has 41.6 percent of original size [2019-12-07 16:58:04,224 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:58:04,225 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:57 [2019-12-07 16:58:10,279 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 16:58:12,332 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:12,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2019-12-07 16:58:12,333 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:12,343 INFO L614 ElimStorePlain]: treesize reduction 16, result has 54.3 percent of original size [2019-12-07 16:58:12,344 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:58:12,344 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:19 [2019-12-07 16:58:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:12,397 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:58:13,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1489 treesize of output 1465 [2019-12-07 16:58:13,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,063 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:58:13,856 WARN L192 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-12-07 16:58:13,857 INFO L614 ElimStorePlain]: treesize reduction 1312, result has 10.4 percent of original size [2019-12-07 16:58:13,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:13,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:13,880 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 21 dim-0 vars, and 10 xjuncts. [2019-12-07 16:58:13,880 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:147, output treesize:1235 [2019-12-07 16:58:14,075 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 27 [2019-12-07 16:58:14,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:14,578 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 16:58:14,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001342702] [2019-12-07 16:58:14,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1364412197] [2019-12-07 16:58:14,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:58:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:14,738 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 16:58:14,740 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:14,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:58:14,744 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:14,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:14,748 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:14,748 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 16:58:14,827 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:14,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 16:58:14,827 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:14,850 INFO L614 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-12-07 16:58:14,851 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:14,851 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-12-07 16:58:14,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:58:14,896 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:14,909 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:14,909 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:14,909 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:38 [2019-12-07 16:58:15,064 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:15,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 59 [2019-12-07 16:58:15,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:15,065 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:58:15,112 INFO L614 ElimStorePlain]: treesize reduction 66, result has 43.6 percent of original size [2019-12-07 16:58:15,112 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:58:15,113 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 [2019-12-07 16:58:21,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:21,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 111 [2019-12-07 16:58:21,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:21,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:21,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:21,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:21,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:21,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:21,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:21,365 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-12-07 16:58:25,542 WARN L192 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 60 DAG size of output: 29 [2019-12-07 16:58:25,543 INFO L614 ElimStorePlain]: treesize reduction 699, result has 7.9 percent of original size [2019-12-07 16:58:25,543 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:58:25,543 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:60 [2019-12-07 16:58:31,645 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-12-07 16:58:33,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:33,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2019-12-07 16:58:33,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:33,739 INFO L614 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-12-07 16:58:33,740 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:58:33,740 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2019-12-07 16:58:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:58:33,762 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:58:33,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1489 treesize of output 1465 [2019-12-07 16:58:33,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:33,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:33,862 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:58:34,607 WARN L192 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-12-07 16:58:34,608 INFO L614 ElimStorePlain]: treesize reduction 1312, result has 10.4 percent of original size [2019-12-07 16:58:34,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:34,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:34,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:34,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:34,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:34,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:34,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:34,616 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 15 dim-0 vars, and 10 xjuncts. [2019-12-07 16:58:34,616 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:147, output treesize:1014 [2019-12-07 16:58:34,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:35,130 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 16:58:35,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177986555] [2019-12-07 16:58:35,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:58:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:58:35,179 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 16:58:35,180 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:58:35,217 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:35,217 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 16:58:35,218 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:35,245 INFO L614 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-12-07 16:58:35,245 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:35,245 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-12-07 16:58:35,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:58:35,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:58:35,262 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:35,262 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:58:35,262 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:38 [2019-12-07 16:58:35,291 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:35,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 59 [2019-12-07 16:58:35,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:35,292 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:58:35,337 INFO L614 ElimStorePlain]: treesize reduction 68, result has 42.9 percent of original size [2019-12-07 16:58:35,337 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:58:35,337 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 [2019-12-07 16:58:35,416 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:58:35,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 111 [2019-12-07 16:58:35,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:35,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:35,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:35,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:35,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:35,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:58:35,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:58:35,420 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 6 xjuncts. [2019-12-07 16:59:08,071 WARN L192 SmtUtils]: Spent 32.65 s on a formula simplification. DAG size of input: 64 DAG size of output: 29 [2019-12-07 16:59:08,072 INFO L614 ElimStorePlain]: treesize reduction 1161, result has 4.9 percent of original size [2019-12-07 16:59:08,072 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:59:08,072 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:60 [2019-12-07 16:59:08,086 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:08,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2019-12-07 16:59:08,087 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:08,102 INFO L614 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-12-07 16:59:08,102 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:59:08,103 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2019-12-07 16:59:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:08,131 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:59:08,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1489 treesize of output 1465 [2019-12-07 16:59:08,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,166 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:59:08,913 WARN L192 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-12-07 16:59:08,913 INFO L614 ElimStorePlain]: treesize reduction 1312, result has 10.4 percent of original size [2019-12-07 16:59:08,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:08,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:08,921 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 15 dim-0 vars, and 10 xjuncts. [2019-12-07 16:59:08,921 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:147, output treesize:1014 [2019-12-07 16:59:08,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:09,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:09,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-12-07 16:59:09,494 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:09,495 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:09,495 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:09,495 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:1 [2019-12-07 16:59:09,499 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 16:59:09,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 16:59:09,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 13, 12] total 33 [2019-12-07 16:59:09,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464068494] [2019-12-07 16:59:09,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 16:59:09,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:59:09,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 16:59:09,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=899, Unknown=9, NotChecked=0, Total=1122 [2019-12-07 16:59:09,501 INFO L87 Difference]: Start difference. First operand 268 states and 324 transitions. Second operand 34 states. [2019-12-07 16:59:56,845 WARN L192 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2019-12-07 17:00:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:20,641 INFO L93 Difference]: Finished difference Result 701 states and 832 transitions. [2019-12-07 17:00:20,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 17:00:20,642 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 31 [2019-12-07 17:00:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:20,644 INFO L225 Difference]: With dead ends: 701 [2019-12-07 17:00:20,644 INFO L226 Difference]: Without dead ends: 701 [2019-12-07 17:00:20,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 120 SyntacticMatches, 28 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 72.3s TimeCoverageRelationStatistics Valid=617, Invalid=1802, Unknown=31, NotChecked=0, Total=2450 [2019-12-07 17:00:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-12-07 17:00:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 360. [2019-12-07 17:00:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-12-07 17:00:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 454 transitions. [2019-12-07 17:00:20,650 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 454 transitions. Word has length 31 [2019-12-07 17:00:20,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:20,650 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 454 transitions. [2019-12-07 17:00:20,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 17:00:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 454 transitions. [2019-12-07 17:00:20,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:00:20,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:20,651 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:21,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 mathsat -unsat_core_generation=3 [2019-12-07 17:00:21,253 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 17:00:21,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:21,254 INFO L82 PathProgramCache]: Analyzing trace with hash 446189167, now seen corresponding path program 1 times [2019-12-07 17:00:21,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:21,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505856072] [2019-12-07 17:00:21,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 17:00:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:21,335 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 17:00:21,336 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:21,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:00:21,338 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:21,340 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:21,340 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:21,340 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:00:21,351 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_123|], 1=[|v_#valid_149|]} [2019-12-07 17:00:21,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:00:21,355 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:21,370 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:21,377 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:21,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:21,378 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:21,387 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:21,388 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:21,388 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2019-12-07 17:00:21,407 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:00:21,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:21,424 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:21,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:00:21,428 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:21,444 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:21,444 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:21,444 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2019-12-07 17:00:21,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:21,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 70 [2019-12-07 17:00:21,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:21,525 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 17:00:21,597 INFO L614 ElimStorePlain]: treesize reduction 79, result has 48.0 percent of original size [2019-12-07 17:00:21,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-12-07 17:00:21,602 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:21,622 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:21,622 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:21,622 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:63 [2019-12-07 17:00:21,770 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:21,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 129 [2019-12-07 17:00:21,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:21,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:21,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:21,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:21,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:21,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:21,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:21,774 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 6 xjuncts. [2019-12-07 17:00:42,464 WARN L192 SmtUtils]: Spent 20.69 s on a formula simplification. DAG size of input: 77 DAG size of output: 35 [2019-12-07 17:00:42,464 INFO L614 ElimStorePlain]: treesize reduction 1694, result has 5.4 percent of original size [2019-12-07 17:00:42,497 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:42,497 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 70 [2019-12-07 17:00:42,497 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:46,615 WARN L192 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-12-07 17:00:46,616 INFO L614 ElimStorePlain]: treesize reduction 26, result has 77.0 percent of original size [2019-12-07 17:00:46,616 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:46,616 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:107, output treesize:87 [2019-12-07 17:00:52,756 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:52,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 44 [2019-12-07 17:00:52,757 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:52,791 INFO L614 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-12-07 17:00:52,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 17:00:52,793 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:52,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:52,799 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:52,799 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:79, output treesize:11 [2019-12-07 17:00:52,860 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 17:00:52,860 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:56,075 WARN L192 SmtUtils]: Spent 576.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 17:01:03,943 WARN L192 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 17:02:33,645 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-12-07 17:02:33,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505856072] [2019-12-07 17:02:33,646 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2019-12-07 17:02:33,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2065874120] [2019-12-07 17:02:33,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 17:02:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:02:33,806 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 17:02:33,807 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:02:33,808 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@24a2a0b [2019-12-07 17:02:33,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029512795] [2019-12-07 17:02:33,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b93908b-dfb2-46ba-982b-36b5ce87463d/bin/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:02:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:02:33,861 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 17:02:33,861 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:02:33,862 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@24a2a0b [2019-12-07 17:02:33,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:02:33,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 17:02:33,862 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 17:02:33,862 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:02:34,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 mathsat -unsat_core_generation=3,29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 17:02:34,481 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 17:02:34,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:02:34 BoogieIcfgContainer [2019-12-07 17:02:34,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:02:34,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:02:34,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:02:34,482 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:02:34,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:57:30" (3/4) ... [2019-12-07 17:02:34,484 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:02:34,484 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:02:34,485 INFO L168 Benchmark]: Toolchain (without parser) took 304666.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -205.1 MB). Peak memory consumption was 113.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:02:34,486 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:02:34,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:02:34,486 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:02:34,486 INFO L168 Benchmark]: Boogie Preprocessor took 26.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:02:34,486 INFO L168 Benchmark]: RCFGBuilder took 563.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:02:34,487 INFO L168 Benchmark]: TraceAbstraction took 303673.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.0 MB). Peak memory consumption was 75.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:02:34,487 INFO L168 Benchmark]: Witness Printer took 2.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:02:34,488 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 563.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 303673.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.0 MB). Peak memory consumption was 75.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 527]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L522] struct TreeNode* root = malloc(sizeof(*root)), *n; [L523] root->left = ((void *)0) [L524] root->right = ((void *)0) [L525] COND TRUE __VERIFIER_nondet_int() [L526] n = root [L527] EXPR n->left [L527] n->left && n->right [L527] COND FALSE !(n->left && n->right) [L533] EXPR n->left [L533] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L538] EXPR n->right [L538] COND TRUE !n->right && __VERIFIER_nondet_int() [L539] n->right = malloc(sizeof(*n)) [L540] EXPR n->right [L540] n->right->left = ((void *)0) [L541] EXPR n->right [L541] n->right->right = ((void *)0) [L525] COND TRUE __VERIFIER_nondet_int() [L526] n = root [L527] EXPR n->left [L527] n->left && n->right [L527] EXPR n->right [L527] n->left && n->right [L527] COND TRUE n->left && n->right [L528] COND FALSE !(__VERIFIER_nondet_int()) [L531] EXPR n->right [L531] n = n->right [L527] n->left - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 153 locations, 77 error locations. Result: UNKNOWN, OverallTime: 303.6s, OverallIterations: 22, TraceHistogramMax: 3, AutomataDifference: 90.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2164 SDtfs, 5621 SDslu, 6098 SDs, 0 SdLazy, 9411 SolverSat, 556 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 38.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 942 GetRequests, 628 SyntacticMatches, 45 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2261 ImplicationChecksByTransitivity, 78.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=360occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 1482 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 71.8s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 838 ConstructedInterpolants, 123 QuantifiedInterpolants, 276609 SizeOfPredicates, 260 NumberOfNonLiveVariables, 1989 ConjunctsInSsa, 271 ConjunctsInUnsatCore, 52 InterpolantComputations, 37 PerfectInterpolantSequences, 43/140 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...