./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.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_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 01382a83f29e54aeac6cc6b531356e714ec88448 ........................................................................................................................................ 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_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 01382a83f29e54aeac6cc6b531356e714ec88448 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:14:52,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:14:52,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:14:52,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:14:52,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:14:52,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:14:52,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:14:52,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:14:52,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:14:52,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:14:52,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:14:52,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:14:52,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:14:52,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:14:52,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:14:52,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:14:52,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:14:52,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:14:52,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:14:52,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:14:52,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:14:52,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:14:52,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:14:52,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:14:52,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:14:52,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:14:52,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:14:52,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:14:52,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:14:52,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:14:52,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:14:52,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:14:52,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:14:52,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:14:52,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:14:52,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:14:52,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:14:52,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:14:52,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:14:52,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:14:52,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:14:52,798 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 12:14:52,810 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:14:52,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:14:52,811 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:14:52,811 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:14:52,811 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:14:52,811 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:14:52,811 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:14:52,812 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:14:52,812 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:14:52,812 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:14:52,812 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:14:52,812 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:14:52,812 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:14:52,812 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:14:52,813 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:14:52,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:14:52,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:14:52,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:14:52,813 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:14:52,813 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:14:52,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:14:52,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:14:52,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:14:52,814 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:14:52,814 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:14:52,814 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:14:52,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:14:52,814 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:14:52,814 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:14:52,815 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:14:52,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:14:52,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:14:52,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:14:52,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:14:52,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:14:52,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:14:52,815 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:14:52,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:14:52,816 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:14:52,816 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:14:52,816 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_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 -> 01382a83f29e54aeac6cc6b531356e714ec88448 [2019-12-07 12:14:52,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:14:52,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:14:52,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:14:52,942 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:14:52,942 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:14:52,943 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2019-12-07 12:14:52,985 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/data/13cdfdfbd/b9fdb118ba9b49f7b0345104b079c55c/FLAG78747a170 [2019-12-07 12:14:53,386 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:14:53,386 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2019-12-07 12:14:53,395 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/data/13cdfdfbd/b9fdb118ba9b49f7b0345104b079c55c/FLAG78747a170 [2019-12-07 12:14:53,751 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/data/13cdfdfbd/b9fdb118ba9b49f7b0345104b079c55c [2019-12-07 12:14:53,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:14:53,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:14:53,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:14:53,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:14:53,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:14:53,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:14:53" (1/1) ... [2019-12-07 12:14:53,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36bfbaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:53, skipping insertion in model container [2019-12-07 12:14:53,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:14:53" (1/1) ... [2019-12-07 12:14:53,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:14:53,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:14:54,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:14:54,034 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 12:14:54,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@360ba058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:54, skipping insertion in model container [2019-12-07 12:14:54,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:14:54,035 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2019-12-07 12:14:54,037 INFO L168 Benchmark]: Toolchain (without parser) took 277.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:14:54,037 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:14:54,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:14:54,039 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 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 545]: 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 12:14:55,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:14:55,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:14:55,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:14:55,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:14:55,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:14:55,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:14:55,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:14:55,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:14:55,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:14:55,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:14:55,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:14:55,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:14:55,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:14:55,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:14:55,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:14:55,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:14:55,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:14:55,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:14:55,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:14:55,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:14:55,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:14:55,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:14:55,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:14:55,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:14:55,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:14:55,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:14:55,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:14:55,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:14:55,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:14:55,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:14:55,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:14:55,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:14:55,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:14:55,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:14:55,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:14:55,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:14:55,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:14:55,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:14:55,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:14:55,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:14:55,280 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 12:14:55,292 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:14:55,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:14:55,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:14:55,293 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:14:55,293 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:14:55,293 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:14:55,293 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:14:55,293 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:14:55,293 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:14:55,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:14:55,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:14:55,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:14:55,294 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:14:55,295 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:14:55,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:14:55,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:14:55,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:14:55,295 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:14:55,295 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:14:55,296 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:14:55,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:14:55,296 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:14:55,296 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 12:14:55,296 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 12:14:55,296 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:14:55,296 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:14:55,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:14:55,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:14:55,297 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:14:55,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:14:55,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:14:55,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:14:55,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:14:55,297 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 12:14:55,297 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 12:14:55,298 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:14:55,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:14:55,298 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_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 -> 01382a83f29e54aeac6cc6b531356e714ec88448 [2019-12-07 12:14:55,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:14:55,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:14:55,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:14:55,469 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:14:55,469 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:14:55,470 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2019-12-07 12:14:55,516 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/data/3c9bbee40/7d12c7b794424005adc9373dc6d89924/FLAGe9945a8e2 [2019-12-07 12:14:55,880 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:14:55,881 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2019-12-07 12:14:55,890 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/data/3c9bbee40/7d12c7b794424005adc9373dc6d89924/FLAGe9945a8e2 [2019-12-07 12:14:55,898 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/data/3c9bbee40/7d12c7b794424005adc9373dc6d89924 [2019-12-07 12:14:55,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:14:55,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:14:55,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:14:55,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:14:55,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:14:55,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:14:55" (1/1) ... [2019-12-07 12:14:55,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7867ea24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:55, skipping insertion in model container [2019-12-07 12:14:55,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:14:55" (1/1) ... [2019-12-07 12:14:55,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:14:55,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:14:56,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:14:56,156 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 12:14:56,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:14:56,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:14:56,187 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:14:56,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:14:56,255 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:14:56,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:56 WrapperNode [2019-12-07 12:14:56,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:14:56,256 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:14:56,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:14:56,256 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:14:56,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:56" (1/1) ... [2019-12-07 12:14:56,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:56" (1/1) ... [2019-12-07 12:14:56,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:14:56,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:14:56,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:14:56,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:14:56,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:56" (1/1) ... [2019-12-07 12:14:56,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:56" (1/1) ... [2019-12-07 12:14:56,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:56" (1/1) ... [2019-12-07 12:14:56,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:56" (1/1) ... [2019-12-07 12:14:56,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:56" (1/1) ... [2019-12-07 12:14:56,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:56" (1/1) ... [2019-12-07 12:14:56,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:56" (1/1) ... [2019-12-07 12:14:56,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:14:56,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:14:56,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:14:56,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:14:56,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:14:56,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 12:14:56,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:14:56,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:14:56,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:14:56,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:14:56,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:14:56,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 12:14:56,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 12:14:56,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:14:56,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:14:57,305 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:14:57,306 INFO L287 CfgBuilder]: Removed 18 assume(true) statements. [2019-12-07 12:14:57,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:14:57 BoogieIcfgContainer [2019-12-07 12:14:57,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:14:57,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:14:57,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:14:57,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:14:57,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:14:55" (1/3) ... [2019-12-07 12:14:57,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e561ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:14:57, skipping insertion in model container [2019-12-07 12:14:57,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:14:56" (2/3) ... [2019-12-07 12:14:57,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e561ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:14:57, skipping insertion in model container [2019-12-07 12:14:57,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:14:57" (3/3) ... [2019-12-07 12:14:57,312 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2019-12-07 12:14:57,319 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:14:57,324 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 132 error locations. [2019-12-07 12:14:57,332 INFO L249 AbstractCegarLoop]: Starting to check reachability of 132 error locations. [2019-12-07 12:14:57,345 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:14:57,345 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 12:14:57,345 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:14:57,345 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:14:57,345 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:14:57,345 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:14:57,346 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:14:57,346 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:14:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states. [2019-12-07 12:14:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 12:14:57,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:14:57,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 12:14:57,368 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:14:57,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:14:57,372 INFO L82 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2019-12-07 12:14:57,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:14:57,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685211695] [2019-12-07 12:14:57,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:14:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:57,432 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:14:57,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:14:57,474 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 12:14:57,475 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:14:57,480 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:14:57,481 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:14:57,481 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:14:57,509 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:14:57,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-07 12:14:57,510 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:14:57,530 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 12:14:57,530 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:14:57,531 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-12-07 12:14:57,544 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 12:14:57,544 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:14:57,555 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 12:14:57,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685211695] [2019-12-07 12:14:57,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:14:57,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 12:14:57,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18166404] [2019-12-07 12:14:57,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:14:57,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:14:57,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:14:57,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:14:57,578 INFO L87 Difference]: Start difference. First operand 265 states. Second operand 4 states. [2019-12-07 12:14:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:14:58,094 INFO L93 Difference]: Finished difference Result 283 states and 301 transitions. [2019-12-07 12:14:58,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:14:58,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 12:14:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:14:58,105 INFO L225 Difference]: With dead ends: 283 [2019-12-07 12:14:58,105 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 12:14:58,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 12:14:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 12:14:58,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 255. [2019-12-07 12:14:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 12:14:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 272 transitions. [2019-12-07 12:14:58,140 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 272 transitions. Word has length 4 [2019-12-07 12:14:58,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:14:58,140 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 272 transitions. [2019-12-07 12:14:58,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:14:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 272 transitions. [2019-12-07 12:14:58,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 12:14:58,141 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:14:58,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 12:14:58,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 12:14:58,343 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:14:58,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:14:58,345 INFO L82 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2019-12-07 12:14:58,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:14:58,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688692438] [2019-12-07 12:14:58,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:14:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:14:58,422 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:14:58,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:14:58,429 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 12:14:58,429 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:14:58,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:14:58,438 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 12:14:58,438 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:14:58,444 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:14:58,444 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:14:58,445 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 12:14:58,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:14:58,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 12:14:58,462 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:14:58,473 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:14:58,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:14:58,477 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2019-12-07 12:14:58,478 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:14:58,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:14:58,485 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:14:58,485 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:16 [2019-12-07 12:14:58,498 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 12:14:58,498 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:14:58,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:14:58,611 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 12:14:58,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688692438] [2019-12-07 12:14:58,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:14:58,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 12:14:58,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507020063] [2019-12-07 12:14:58,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:14:58,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:14:58,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:14:58,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:14:58,614 INFO L87 Difference]: Start difference. First operand 255 states and 272 transitions. Second operand 6 states. [2019-12-07 12:15:07,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:07,208 INFO L93 Difference]: Finished difference Result 395 states and 416 transitions. [2019-12-07 12:15:07,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:15:07,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-12-07 12:15:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:07,212 INFO L225 Difference]: With dead ends: 395 [2019-12-07 12:15:07,212 INFO L226 Difference]: Without dead ends: 395 [2019-12-07 12:15:07,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:15:07,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-12-07 12:15:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 266. [2019-12-07 12:15:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 12:15:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 290 transitions. [2019-12-07 12:15:07,231 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 290 transitions. Word has length 4 [2019-12-07 12:15:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:07,231 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 290 transitions. [2019-12-07 12:15:07,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:15:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 290 transitions. [2019-12-07 12:15:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:15:07,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:07,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:15:07,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 12:15:07,435 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:15:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:07,436 INFO L82 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2019-12-07 12:15:07,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:07,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078882447] [2019-12-07 12:15:07,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:15:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:07,490 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:15:07,492 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:07,496 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 12:15:07,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:07,498 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:07,498 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:07,498 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:15:07,501 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 12:15:07,501 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:07,502 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 12:15:07,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078882447] [2019-12-07 12:15:07,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:07,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 12:15:07,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629867678] [2019-12-07 12:15:07,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:15:07,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:07,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:15:07,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:15:07,503 INFO L87 Difference]: Start difference. First operand 266 states and 290 transitions. Second operand 3 states. [2019-12-07 12:15:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:07,920 INFO L93 Difference]: Finished difference Result 279 states and 299 transitions. [2019-12-07 12:15:07,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:07,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 12:15:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:07,921 INFO L225 Difference]: With dead ends: 279 [2019-12-07 12:15:07,921 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 12:15:07,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 12:15:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 12:15:07,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 262. [2019-12-07 12:15:07,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 12:15:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 284 transitions. [2019-12-07 12:15:07,928 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 284 transitions. Word has length 5 [2019-12-07 12:15:07,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:07,928 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 284 transitions. [2019-12-07 12:15:07,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:15:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 284 transitions. [2019-12-07 12:15:07,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:15:07,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:07,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:15:08,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 12:15:08,131 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:15:08,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:08,132 INFO L82 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2019-12-07 12:15:08,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:08,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813997543] [2019-12-07 12:15:08,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:15:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:08,219 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:15:08,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:08,224 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 12:15:08,224 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:08,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:08,231 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:08,231 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 12:15:08,237 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 12:15:08,237 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:08,274 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 12:15:08,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813997543] [2019-12-07 12:15:08,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:08,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 12:15:08,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238308941] [2019-12-07 12:15:08,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:15:08,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:08,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:15:08,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:15:08,275 INFO L87 Difference]: Start difference. First operand 262 states and 284 transitions. Second operand 4 states. [2019-12-07 12:15:09,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:09,512 INFO L93 Difference]: Finished difference Result 407 states and 437 transitions. [2019-12-07 12:15:09,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:15:09,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 12:15:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:09,515 INFO L225 Difference]: With dead ends: 407 [2019-12-07 12:15:09,515 INFO L226 Difference]: Without dead ends: 407 [2019-12-07 12:15:09,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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 12:15:09,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-12-07 12:15:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 264. [2019-12-07 12:15:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-12-07 12:15:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 286 transitions. [2019-12-07 12:15:09,522 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 286 transitions. Word has length 5 [2019-12-07 12:15:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:09,522 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 286 transitions. [2019-12-07 12:15:09,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:15:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 286 transitions. [2019-12-07 12:15:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:15:09,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:09,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:09,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 12:15:09,724 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:15:09,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1328641074, now seen corresponding path program 1 times [2019-12-07 12:15:09,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:09,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614620225] [2019-12-07 12:15:09,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:15:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:09,761 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:15:09,762 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:09,765 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 12:15:09,765 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:09,766 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 12:15:09,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614620225] [2019-12-07 12:15:09,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:09,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 12:15:09,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205680496] [2019-12-07 12:15:09,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:15:09,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:09,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:15:09,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:15:09,768 INFO L87 Difference]: Start difference. First operand 264 states and 286 transitions. Second operand 3 states. [2019-12-07 12:15:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:09,782 INFO L93 Difference]: Finished difference Result 255 states and 275 transitions. [2019-12-07 12:15:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:09,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 12:15:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:09,784 INFO L225 Difference]: With dead ends: 255 [2019-12-07 12:15:09,784 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 12:15:09,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 12:15:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 12:15:09,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-12-07 12:15:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 12:15:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 275 transitions. [2019-12-07 12:15:09,788 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 275 transitions. Word has length 10 [2019-12-07 12:15:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:09,788 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 275 transitions. [2019-12-07 12:15:09,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:15:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 275 transitions. [2019-12-07 12:15:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:15:09,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:09,789 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:09,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 12:15:09,991 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:15:09,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:09,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1328508074, now seen corresponding path program 1 times [2019-12-07 12:15:09,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:09,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273992334] [2019-12-07 12:15:09,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:15:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:10,044 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 12:15:10,045 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:10,050 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 12:15:10,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:10,057 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:10,058 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:10,058 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-12-07 12:15:10,074 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:10,074 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 12:15:10,075 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:10,081 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:10,082 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:10,082 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2019-12-07 12:15:10,101 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 12:15:10,102 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:10,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:10,125 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 12:15:10,126 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:10,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:10,141 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:10,141 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:15 [2019-12-07 12:15:10,155 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 12:15:10,155 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:10,161 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:10,163 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 12:15:10,163 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:10,166 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:10,167 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 12:15:10,167 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-12-07 12:15:10,176 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 12:15:10,176 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:12,617 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-12-07 12:15:12,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:15:16,732 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 12:15:16,738 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 12:15:16,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273992334] [2019-12-07 12:15:16,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:16,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2019-12-07 12:15:16,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161905398] [2019-12-07 12:15:16,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:15:16,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:16,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:15:16,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=37, Unknown=2, NotChecked=0, Total=56 [2019-12-07 12:15:16,739 INFO L87 Difference]: Start difference. First operand 255 states and 275 transitions. Second operand 8 states. [2019-12-07 12:15:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:17,902 INFO L93 Difference]: Finished difference Result 266 states and 286 transitions. [2019-12-07 12:15:17,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:15:17,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-12-07 12:15:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:17,904 INFO L225 Difference]: With dead ends: 266 [2019-12-07 12:15:17,904 INFO L226 Difference]: Without dead ends: 266 [2019-12-07 12:15:17,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=30, Invalid=58, Unknown=2, NotChecked=0, Total=90 [2019-12-07 12:15:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-07 12:15:17,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 261. [2019-12-07 12:15:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-12-07 12:15:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 281 transitions. [2019-12-07 12:15:17,907 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 281 transitions. Word has length 10 [2019-12-07 12:15:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:17,908 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 281 transitions. [2019-12-07 12:15:17,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:15:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 281 transitions. [2019-12-07 12:15:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:15:17,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:17,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:18,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 12:15:18,110 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:15:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:18,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1761805906, now seen corresponding path program 1 times [2019-12-07 12:15:18,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:18,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892564856] [2019-12-07 12:15:18,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:15:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:18,183 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:15:18,184 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:18,200 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 12:15:18,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 12:15:18,201 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:18,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:18,208 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:18,208 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-12-07 12:15:18,217 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 12:15:18,217 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:18,224 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 12:15:18,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892564856] [2019-12-07 12:15:18,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:18,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 12:15:18,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121268604] [2019-12-07 12:15:18,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:15:18,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:18,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:15:18,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:15:18,226 INFO L87 Difference]: Start difference. First operand 261 states and 281 transitions. Second operand 4 states. [2019-12-07 12:15:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:18,747 INFO L93 Difference]: Finished difference Result 282 states and 306 transitions. [2019-12-07 12:15:18,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:15:18,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:15:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:18,749 INFO L225 Difference]: With dead ends: 282 [2019-12-07 12:15:18,749 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 12:15:18,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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 12:15:18,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 12:15:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 231. [2019-12-07 12:15:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-07 12:15:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2019-12-07 12:15:18,754 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 11 [2019-12-07 12:15:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:18,754 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2019-12-07 12:15:18,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:15:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2019-12-07 12:15:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:15:18,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:18,754 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:18,955 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 12:15:18,956 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:15:18,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:18,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1761805907, now seen corresponding path program 1 times [2019-12-07 12:15:18,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:18,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935202009] [2019-12-07 12:15:18,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:15:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:19,065 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:15:19,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:19,070 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_149|], 1=[|v_#valid_169|]} [2019-12-07 12:15:19,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:15:19,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:15:19,074 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:19,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:19,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:15:19,086 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 5 treesize of output 3 [2019-12-07 12:15:19,086 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:19,092 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:19,093 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:19,093 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-12-07 12:15:19,102 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 12:15:19,102 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:19,140 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 12:15:19,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935202009] [2019-12-07 12:15:19,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:19,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 12:15:19,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573470856] [2019-12-07 12:15:19,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:15:19,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:19,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:15:19,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:15:19,141 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand 4 states. [2019-12-07 12:15:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:20,234 INFO L93 Difference]: Finished difference Result 365 states and 394 transitions. [2019-12-07 12:15:20,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:15:20,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:15:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:20,237 INFO L225 Difference]: With dead ends: 365 [2019-12-07 12:15:20,237 INFO L226 Difference]: Without dead ends: 365 [2019-12-07 12:15:20,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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 12:15:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-12-07 12:15:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 213. [2019-12-07 12:15:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-07 12:15:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 233 transitions. [2019-12-07 12:15:20,242 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 233 transitions. Word has length 11 [2019-12-07 12:15:20,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:20,242 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 233 transitions. [2019-12-07 12:15:20,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:15:20,242 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 233 transitions. [2019-12-07 12:15:20,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:15:20,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:20,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:20,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 12:15:20,444 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:15:20,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:20,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2003218563, now seen corresponding path program 1 times [2019-12-07 12:15:20,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:20,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793906595] [2019-12-07 12:15:20,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:15:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:20,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:15:20,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:20,551 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 12:15:20,551 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:15:20,552 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:20,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:20,556 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:15:20,556 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 12:15:20,564 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 12:15:20,565 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:20,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:20,572 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 12:15:20,572 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 12:15:20,581 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 12:15:20,581 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:20,583 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:20,583 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 12:15:20,583 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-12-07 12:15:20,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 12:15:20,589 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:20,591 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 12:15:20,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793906595] [2019-12-07 12:15:20,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:20,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 12:15:20,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753625885] [2019-12-07 12:15:20,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:15:20,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:20,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:15:20,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:15:20,592 INFO L87 Difference]: Start difference. First operand 213 states and 233 transitions. Second operand 5 states. [2019-12-07 12:15:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:21,620 INFO L93 Difference]: Finished difference Result 320 states and 354 transitions. [2019-12-07 12:15:21,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:15:21,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 12:15:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:21,622 INFO L225 Difference]: With dead ends: 320 [2019-12-07 12:15:21,622 INFO L226 Difference]: Without dead ends: 320 [2019-12-07 12:15:21,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 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 12:15:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-07 12:15:21,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 219. [2019-12-07 12:15:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-07 12:15:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 243 transitions. [2019-12-07 12:15:21,626 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 243 transitions. Word has length 15 [2019-12-07 12:15:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:21,626 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 243 transitions. [2019-12-07 12:15:21,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:15:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 243 transitions. [2019-12-07 12:15:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:15:21,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:21,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:21,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 12:15:21,828 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:15:21,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:21,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2003218562, now seen corresponding path program 1 times [2019-12-07 12:15:21,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:21,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040564501] [2019-12-07 12:15:21,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:15:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:21,919 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:15:21,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:21,932 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:21,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:15:21,933 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:21,950 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:15:21,950 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:21,950 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-12-07 12:15:21,961 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 12:15:21,961 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:21,972 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:21,976 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 12:15:21,976 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:21,984 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:21,985 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 12:15:21,985 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-12-07 12:15:22,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 23 treesize of output 11 [2019-12-07 12:15:22,019 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:22,029 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:22,031 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 12:15:22,031 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:22,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:22,036 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 12:15:22,036 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:12 [2019-12-07 12:15:22,049 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 12:15:22,049 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:15:22,339 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 12:15:22,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040564501] [2019-12-07 12:15:22,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:15:22,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 12:15:22,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469622555] [2019-12-07 12:15:22,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:15:22,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:15:22,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:15:22,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:15:22,340 INFO L87 Difference]: Start difference. First operand 219 states and 243 transitions. Second operand 10 states. [2019-12-07 12:15:26,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:15:26,286 INFO L93 Difference]: Finished difference Result 373 states and 402 transitions. [2019-12-07 12:15:26,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:15:26,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-07 12:15:26,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:15:26,288 INFO L225 Difference]: With dead ends: 373 [2019-12-07 12:15:26,288 INFO L226 Difference]: Without dead ends: 373 [2019-12-07 12:15:26,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:15:26,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-07 12:15:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 219. [2019-12-07 12:15:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-07 12:15:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 239 transitions. [2019-12-07 12:15:26,292 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 239 transitions. Word has length 15 [2019-12-07 12:15:26,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:15:26,293 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 239 transitions. [2019-12-07 12:15:26,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:15:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 239 transitions. [2019-12-07 12:15:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:15:26,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:15:26,293 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:15:26,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 12:15:26,495 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:15:26,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:15:26,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1799893576, now seen corresponding path program 1 times [2019-12-07 12:15:26,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:15:26,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767086934] [2019-12-07 12:15:26,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:15:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:15:26,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:15:26,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:15:26,655 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 12:15:26,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 12:15:26,655 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:26,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:26,660 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:15:26,660 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2019-12-07 12:15:26,671 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 12:15:26,671 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:15:26,684 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:15:26,685 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 12:15:26,685 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-12-07 12:16:27,740 WARN L192 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-07 12:16:27,741 INFO L343 Elim1Store]: treesize reduction 421, result has 38.3 percent of original size [2019-12-07 12:16:27,741 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 4 case distinctions, treesize of input 132 treesize of output 294 [2019-12-07 12:16:27,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:27,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:27,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:16:27,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:16:27,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:16:27,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:27,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:16:27,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:16:27,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:16:27,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:27,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:16:27,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:16:27,752 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-12-07 12:16:27,905 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 17 [2019-12-07 12:16:27,906 INFO L614 ElimStorePlain]: treesize reduction 1178, result has 2.2 percent of original size [2019-12-07 12:16:27,906 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 12:16:27,906 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:137, output treesize:27 [2019-12-07 12:16:27,916 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 31 treesize of output 13 [2019-12-07 12:16:27,917 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:27,922 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:27,922 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 12:16:27,923 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-12-07 12:16:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:16:27,935 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:16:27,969 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:16:28,007 INFO L614 ElimStorePlain]: treesize reduction 132, result has 27.1 percent of original size [2019-12-07 12:16:28,008 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-12-07 12:16:28,008 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:49 [2019-12-07 12:16:29,597 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:31,110 WARN L192 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 227 DAG size of output: 64 [2019-12-07 12:16:31,111 INFO L614 ElimStorePlain]: treesize reduction 9663, result has 1.6 percent of original size [2019-12-07 12:16:31,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:16:31,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:16:31,145 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 27 dim-0 vars, and 9 xjuncts. [2019-12-07 12:16:31,145 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:69, output treesize:830 [2019-12-07 12:16:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:16:31,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767086934] [2019-12-07 12:16:31,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1238231186] [2019-12-07 12:16:31,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:16:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:16:31,384 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 12:16:31,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:16:31,443 INFO L343 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2019-12-07 12:16:31,443 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 3 case distinctions, treesize of input 26 treesize of output 53 [2019-12-07 12:16:31,443 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:31,470 INFO L614 ElimStorePlain]: treesize reduction 17, result has 58.5 percent of original size [2019-12-07 12:16:31,470 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:16:31,470 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2019-12-07 12:16:31,477 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 12:16:31,477 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:16:31,489 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:16:31,489 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 12:16:31,489 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-12-07 12:17:32,760 WARN L192 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-07 12:17:32,761 INFO L343 Elim1Store]: treesize reduction 421, result has 38.3 percent of original size [2019-12-07 12:17:32,761 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 4 case distinctions, treesize of input 132 treesize of output 294 [2019-12-07 12:17:32,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:32,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:17:32,779 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 31 xjuncts. [2019-12-07 12:17:33,139 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 19 [2019-12-07 12:17:33,140 INFO L614 ElimStorePlain]: treesize reduction 4952, result has 0.6 percent of original size [2019-12-07 12:17:33,140 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 12:17:33,140 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:137, output treesize:29 [2019-12-07 12:17:33,144 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 31 treesize of output 13 [2019-12-07 12:17:33,144 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:17:33,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:17:33,149 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 12:17:33,149 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-12-07 12:17:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:17:33,150 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:17:33,154 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:17:33,192 INFO L614 ElimStorePlain]: treesize reduction 132, result has 26.3 percent of original size [2019-12-07 12:17:33,193 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-12-07 12:17:33,193 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:47 [2019-12-07 12:17:37,484 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:17:38,205 WARN L192 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2019-12-07 12:17:38,205 INFO L614 ElimStorePlain]: treesize reduction 999, result has 13.0 percent of original size [2019-12-07 12:17:38,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:17:38,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:17:38,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:17:38,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:17:38,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:17:38,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:17:38,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:17:38,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:17:38,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:17:38,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:17:38,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:17:38,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:17:38,231 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 40 dim-0 vars, and 8 xjuncts. [2019-12-07 12:17:38,231 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:67, output treesize:774 [2019-12-07 12:17:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:17:38,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829828145] [2019-12-07 12:17:38,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:17:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:17:38,353 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:17:38,354 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:17:38,364 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 12:17:38,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 12:17:38,365 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:17:38,370 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:17:38,370 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:17:38,370 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2019-12-07 12:17:38,373 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 12:17:38,373 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:17:38,383 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:17:38,383 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 12:17:38,383 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-12-07 12:18:39,436 WARN L192 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-07 12:18:39,436 INFO L343 Elim1Store]: treesize reduction 421, result has 38.3 percent of original size [2019-12-07 12:18:39,436 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 4 case distinctions, treesize of input 132 treesize of output 294 [2019-12-07 12:18:39,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:18:39,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:18:39,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:18:39,438 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 12:18:47,660 WARN L192 SmtUtils]: Spent 8.22 s on a formula simplification. DAG size of input: 52 DAG size of output: 19 [2019-12-07 12:18:47,660 INFO L614 ElimStorePlain]: treesize reduction 493, result has 5.6 percent of original size [2019-12-07 12:18:47,661 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 12:18:47,661 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:137, output treesize:29 [2019-12-07 12:18:47,664 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 31 treesize of output 13 [2019-12-07 12:18:47,664 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:18:47,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:18:47,669 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 12:18:47,669 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-12-07 12:18:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:18:47,670 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:18:47,674 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:18:47,709 INFO L614 ElimStorePlain]: treesize reduction 132, result has 27.1 percent of original size [2019-12-07 12:18:47,709 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-12-07 12:18:47,709 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:49 [2019-12-07 12:19:01,544 WARN L192 SmtUtils]: Spent 869.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 12:19:01,558 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:19:02,971 WARN L192 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 137 DAG size of output: 58 [2019-12-07 12:19:02,972 INFO L614 ElimStorePlain]: treesize reduction 4549, result has 3.2 percent of original size [2019-12-07 12:19:02,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:19:02,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:19:02,993 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 23 dim-0 vars, and 9 xjuncts. [2019-12-07 12:19:02,993 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:67, output treesize:528 [2019-12-07 12:19:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:19:03,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:19:03,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6, 6, 5, 6] total 15 [2019-12-07 12:19:03,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034105583] [2019-12-07 12:19:03,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 12:19:03,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:19:03,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 12:19:03,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=164, Unknown=8, NotChecked=0, Total=240 [2019-12-07 12:19:03,035 INFO L87 Difference]: Start difference. First operand 219 states and 239 transitions. Second operand 16 states. [2019-12-07 12:19:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:19:06,493 INFO L93 Difference]: Finished difference Result 278 states and 299 transitions. [2019-12-07 12:19:06,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:19:06,494 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-12-07 12:19:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:19:06,495 INFO L225 Difference]: With dead ends: 278 [2019-12-07 12:19:06,495 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 12:19:06,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 96 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=95, Invalid=203, Unknown=8, NotChecked=0, Total=306 [2019-12-07 12:19:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 12:19:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 217. [2019-12-07 12:19:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-12-07 12:19:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 237 transitions. [2019-12-07 12:19:06,498 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 237 transitions. Word has length 20 [2019-12-07 12:19:06,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:19:06,498 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 237 transitions. [2019-12-07 12:19:06,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 12:19:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 237 transitions. [2019-12-07 12:19:06,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:19:06,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:19:06,499 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:19:07,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2019-12-07 12:19:07,103 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:19:07,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:19:07,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1799893575, now seen corresponding path program 1 times [2019-12-07 12:19:07,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:19:07,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657340028] [2019-12-07 12:19:07,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:19:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:19:07,255 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 12:19:07,256 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:19:07,258 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_157|], 1=[|v_#valid_180|]} [2019-12-07 12:19:07,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:19:07,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:19:07,262 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:19:07,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:19:07,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:19:07,273 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 5 treesize of output 3 [2019-12-07 12:19:07,273 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:19:07,278 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:19:07,279 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:19:07,279 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-12-07 12:19:07,291 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 12:19:07,291 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:19:07,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:19:07,309 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 12:19:07,309 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:19:07,321 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:19:07,321 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 12:19:07,321 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-12-07 12:19:07,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:19:07,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:19:07,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:19:07,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:19:07,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:19:07,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:19:07,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:19:07,415 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 13 [2019-12-07 12:19:07,415 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:19:07,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:20:09,106 WARN L192 SmtUtils]: Spent 1.03 m on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-07 12:20:09,107 INFO L343 Elim1Store]: treesize reduction 421, result has 38.3 percent of original size [2019-12-07 12:20:09,107 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 4 case distinctions, treesize of input 124 treesize of output 292 [2019-12-07 12:20:09,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:09,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:09,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:09,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:09,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:09,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:09,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:09,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:09,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:09,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:09,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:09,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:09,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:20:09,131 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 19 xjuncts. [2019-12-07 12:20:23,612 WARN L192 SmtUtils]: Spent 14.48 s on a formula simplification. DAG size of input: 131 DAG size of output: 24 [2019-12-07 12:20:23,613 INFO L614 ElimStorePlain]: treesize reduction 4963, result has 0.7 percent of original size [2019-12-07 12:20:23,613 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 12:20:23,613 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:253, output treesize:33 [2019-12-07 12:20:23,653 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 23 treesize of output 11 [2019-12-07 12:20:23,653 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:20:23,667 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:20:23,669 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 12:20:23,669 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:20:23,676 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:20:23,677 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:20:23,677 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:19 [2019-12-07 12:20:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:23,699 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:20:24,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:24,032 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:20:24,043 INFO L534 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:20:24,502 WARN L192 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-12-07 12:20:24,502 INFO L614 ElimStorePlain]: treesize reduction 262, result has 54.0 percent of original size [2019-12-07 12:20:24,515 INFO L534 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:20:24,532 INFO L534 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:20:24,852 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-12-07 12:20:24,852 INFO L614 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2019-12-07 12:20:24,853 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2019-12-07 12:20:24,853 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2019-12-07 12:20:29,614 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 12:20:35,305 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-07 12:20:38,601 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-07 12:20:38,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:20:46,181 WARN L192 SmtUtils]: Spent 7.55 s on a formula simplification. DAG size of input: 162 DAG size of output: 98 [2019-12-07 12:20:46,181 INFO L614 ElimStorePlain]: treesize reduction 9964, result has 4.6 percent of original size [2019-12-07 12:20:46,216 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:20:53,272 WARN L192 SmtUtils]: Spent 7.06 s on a formula simplification. DAG size of input: 538 DAG size of output: 89 [2019-12-07 12:20:53,273 INFO L614 ElimStorePlain]: treesize reduction 20315, result has 1.2 percent of original size [2019-12-07 12:20:53,287 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:20:55,505 WARN L192 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 123 DAG size of output: 111 [2019-12-07 12:20:55,506 INFO L614 ElimStorePlain]: treesize reduction 363, result has 42.6 percent of original size [2019-12-07 12:20:55,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:20:55,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:20:55,582 INFO L534 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 80 dim-0 vars, and 13 xjuncts. [2019-12-07 12:20:55,583 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:1031 [2019-12-07 12:20:56,579 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 366 DAG size of output: 14 [2019-12-07 12:20:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:20:56,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657340028] [2019-12-07 12:20:56,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [32620327] [2019-12-07 12:20:56,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:20:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:20:56,746 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 12:20:56,747 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:20:56,749 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_159|], 1=[|v_#valid_182|]} [2019-12-07 12:20:56,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:20:56,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:20:56,754 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:20:56,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:20:56,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:20:56,765 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 5 treesize of output 3 [2019-12-07 12:20:56,765 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:20:56,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:20:56,772 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:20:56,772 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-12-07 12:20:56,777 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 12:20:56,778 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:20:56,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:20:56,796 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 12:20:56,797 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:20:56,813 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:20:56,813 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 12:20:56,813 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-12-07 12:20:56,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:20:56,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:20:56,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:20:56,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:20:56,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:20:56,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:20:56,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:20:56,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 13 [2019-12-07 12:20:56,851 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:20:56,898 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:21:58,008 WARN L192 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-07 12:21:58,008 INFO L343 Elim1Store]: treesize reduction 421, result has 38.3 percent of original size [2019-12-07 12:21:58,009 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 4 case distinctions, treesize of input 124 treesize of output 292 [2019-12-07 12:21:58,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:21:58,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:21:58,054 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 35 xjuncts. [2019-12-07 12:21:58,584 WARN L192 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 24 [2019-12-07 12:21:58,584 INFO L614 ElimStorePlain]: treesize reduction 8225, result has 0.4 percent of original size [2019-12-07 12:21:58,585 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 12:21:58,585 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:253, output treesize:33 [2019-12-07 12:21:58,601 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 23 treesize of output 11 [2019-12-07 12:21:58,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:21:58,616 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:21:58,618 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 12:21:58,618 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:21:58,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:21:58,626 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:21:58,627 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:19 [2019-12-07 12:21:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:58,629 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:21:58,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:21:58,650 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:21:58,681 INFO L534 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:21:59,048 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-12-07 12:21:59,048 INFO L614 ElimStorePlain]: treesize reduction 262, result has 47.4 percent of original size [2019-12-07 12:21:59,059 INFO L534 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:21:59,069 INFO L534 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:21:59,358 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-07 12:21:59,359 INFO L614 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2019-12-07 12:21:59,359 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2019-12-07 12:21:59,359 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2019-12-07 12:22:03,819 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:22:17,852 WARN L192 SmtUtils]: Spent 14.03 s on a formula simplification. DAG size of input: 522 DAG size of output: 103 [2019-12-07 12:22:17,852 INFO L614 ElimStorePlain]: treesize reduction 63327, result has 0.4 percent of original size [2019-12-07 12:22:17,873 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:22:26,397 WARN L192 SmtUtils]: Spent 8.52 s on a formula simplification. DAG size of input: 186 DAG size of output: 122 [2019-12-07 12:22:26,398 INFO L614 ElimStorePlain]: treesize reduction 9964, result has 4.9 percent of original size [2019-12-07 12:22:26,433 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:22:34,100 WARN L192 SmtUtils]: Spent 7.67 s on a formula simplification. DAG size of input: 561 DAG size of output: 112 [2019-12-07 12:22:34,101 INFO L614 ElimStorePlain]: treesize reduction 20315, result has 1.3 percent of original size [2019-12-07 12:22:34,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:22:34,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:22:34,175 INFO L534 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 80 dim-0 vars, and 11 xjuncts. [2019-12-07 12:22:34,175 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:935 [2019-12-07 12:22:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:22:34,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498810222] [2019-12-07 12:22:34,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:22:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:22:34,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 12:22:34,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:22:34,895 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_161|], 1=[|v_#valid_184|]} [2019-12-07 12:22:34,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:22:34,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:22:34,898 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:22:34,906 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:22:34,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:22:34,909 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 5 treesize of output 3 [2019-12-07 12:22:34,909 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:22:34,914 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:22:34,915 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:22:34,915 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-12-07 12:22:34,920 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 12:22:34,920 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:22:34,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:22:34,937 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 12:22:34,937 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:22:34,948 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:22:34,948 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 12:22:34,948 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-12-07 12:23:36,153 WARN L192 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-07 12:23:36,154 INFO L343 Elim1Store]: treesize reduction 421, result has 38.3 percent of original size [2019-12-07 12:23:36,154 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 4 case distinctions, treesize of input 234 treesize of output 366 [2019-12-07 12:23:36,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:23:36,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:23:36,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:23:36,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:23:36,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:23:36,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:23:36,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:23:36,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:23:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:23:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:23:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:23:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:23:36,162 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 11 xjuncts. [2019-12-07 12:24:05,077 WARN L192 SmtUtils]: Spent 28.91 s on a formula simplification. DAG size of input: 121 DAG size of output: 47 [2019-12-07 12:24:05,077 INFO L614 ElimStorePlain]: treesize reduction 4732, result has 2.9 percent of original size [2019-12-07 12:24:05,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:24:05,088 INFO L343 Elim1Store]: treesize reduction 331, result has 0.3 percent of original size [2019-12-07 12:24:05,088 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 3 case distinctions, treesize of input 120 treesize of output 13 [2019-12-07 12:24:05,088 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:24:05,101 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:24:05,102 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 12:24:05,102 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:253, output treesize:33 [2019-12-07 12:24:05,119 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 23 treesize of output 11 [2019-12-07 12:24:05,119 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:24:05,133 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:24:05,135 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 12:24:05,135 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:24:05,142 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:24:05,143 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:24:05,143 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:19 [2019-12-07 12:24:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:24:05,144 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:24:05,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:05,164 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:24:05,175 INFO L534 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:24:05,686 WARN L192 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-12-07 12:24:05,686 INFO L614 ElimStorePlain]: treesize reduction 262, result has 54.0 percent of original size [2019-12-07 12:24:05,700 INFO L534 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:24:05,738 INFO L534 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 12:24:06,149 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-12-07 12:24:06,150 INFO L614 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2019-12-07 12:24:06,150 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2019-12-07 12:24:06,150 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2019-12-07 12:24:08,865 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:24:13,447 WARN L192 SmtUtils]: Spent 4.58 s on a formula simplification. DAG size of input: 129 DAG size of output: 102 [2019-12-07 12:24:13,448 INFO L614 ElimStorePlain]: treesize reduction 891, result has 21.3 percent of original size [2019-12-07 12:24:13,478 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:24:26,257 WARN L192 SmtUtils]: Spent 12.78 s on a formula simplification. DAG size of input: 186 DAG size of output: 122 [2019-12-07 12:24:26,258 INFO L614 ElimStorePlain]: treesize reduction 9964, result has 4.9 percent of original size [2019-12-07 12:24:26,288 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:24:36,518 WARN L192 SmtUtils]: Spent 10.23 s on a formula simplification. DAG size of input: 561 DAG size of output: 112 [2019-12-07 12:24:36,519 INFO L614 ElimStorePlain]: treesize reduction 20315, result has 1.3 percent of original size [2019-12-07 12:24:36,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:24:36,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:24:36,592 INFO L534 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 80 dim-0 vars, and 11 xjuncts. [2019-12-07 12:24:36,592 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:935 [2019-12-07 12:24:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:24:37,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:24:37,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 8, 7, 8] total 14 [2019-12-07 12:24:37,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123269926] [2019-12-07 12:24:37,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 12:24:37,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:24:37,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 12:24:37,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=160, Unknown=3, NotChecked=0, Total=210 [2019-12-07 12:24:37,306 INFO L87 Difference]: Start difference. First operand 217 states and 237 transitions. Second operand 15 states. [2019-12-07 12:24:39,009 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 37 [2019-12-07 12:24:45,988 WARN L192 SmtUtils]: Spent 6.64 s on a formula simplification. DAG size of input: 130 DAG size of output: 95 [2019-12-07 12:24:59,882 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-12-07 12:25:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:31,663 INFO L93 Difference]: Finished difference Result 489 states and 538 transitions. [2019-12-07 12:25:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:25:31,664 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2019-12-07 12:25:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:31,666 INFO L225 Difference]: With dead ends: 489 [2019-12-07 12:25:31,666 INFO L226 Difference]: Without dead ends: 489 [2019-12-07 12:25:31,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 94 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=197, Invalid=556, Unknown=3, NotChecked=0, Total=756 [2019-12-07 12:25:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-12-07 12:25:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 247. [2019-12-07 12:25:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-12-07 12:25:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 271 transitions. [2019-12-07 12:25:31,671 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 271 transitions. Word has length 20 [2019-12-07 12:25:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:31,671 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 271 transitions. [2019-12-07 12:25:31,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 12:25:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 271 transitions. [2019-12-07 12:25:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 12:25:31,672 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:31,672 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:32,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:32,274 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:25:32,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:32,274 INFO L82 PathProgramCache]: Analyzing trace with hash -116422507, now seen corresponding path program 1 times [2019-12-07 12:25:32,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:25:32,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544145152] [2019-12-07 12:25:32,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:25:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:32,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:25:32,402 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:32,412 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 12:25:32,412 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:32,447 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 12:25:32,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544145152] [2019-12-07 12:25:32,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1513441426] [2019-12-07 12:25:32,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:25:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:32,564 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:25:32,564 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:32,569 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 12:25:32,569 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:32,571 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 12:25:32,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105887327] [2019-12-07 12:25:32,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:32,622 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:25:32,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:32,626 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 12:25:32,626 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:25:32,627 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:25:32,628 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:25:32,628 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:25:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 12:25:32,637 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 12:25:32,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 12:25:32,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5, 5, 5, 5] total 9 [2019-12-07 12:25:32,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83525214] [2019-12-07 12:25:32,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:25:32,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:25:32,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:25:32,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:25:32,639 INFO L87 Difference]: Start difference. First operand 247 states and 271 transitions. Second operand 3 states. [2019-12-07 12:25:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:33,090 INFO L93 Difference]: Finished difference Result 294 states and 320 transitions. [2019-12-07 12:25:33,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:25:33,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 12:25:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:33,092 INFO L225 Difference]: With dead ends: 294 [2019-12-07 12:25:33,092 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 12:25:33,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:25:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 12:25:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 243. [2019-12-07 12:25:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 12:25:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 267 transitions. [2019-12-07 12:25:33,095 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 267 transitions. Word has length 32 [2019-12-07 12:25:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:33,096 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 267 transitions. [2019-12-07 12:25:33,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:25:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 267 transitions. [2019-12-07 12:25:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 12:25:33,096 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:33,096 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:33,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:25:33,700 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:25:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash -116422506, now seen corresponding path program 1 times [2019-12-07 12:25:33,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:25:33,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083728843] [2019-12-07 12:25:33,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/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 12:25:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:33,783 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:25:33,783 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:33,792 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 12:25:33,793 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:33,829 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 12:25:33,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083728843] [2019-12-07 12:25:33,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [171186148] [2019-12-07 12:25:33,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:25:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:33,947 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:25:33,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:33,953 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 12:25:33,953 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:33,955 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 12:25:33,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997046364] [2019-12-07 12:25:33,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:34,012 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:25:34,012 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:34,015 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 12:25:34,016 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:25:34,019 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:25:34,020 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:25:34,020 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 12:25:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 12:25:34,032 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 12:25:34,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 12:25:34,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5, 5, 5, 5] total 10 [2019-12-07 12:25:34,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439018983] [2019-12-07 12:25:34,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:25:34,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:25:34,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:25:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:25:34,087 INFO L87 Difference]: Start difference. First operand 243 states and 267 transitions. Second operand 4 states. [2019-12-07 12:25:35,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:35,007 INFO L93 Difference]: Finished difference Result 320 states and 348 transitions. [2019-12-07 12:25:35,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:25:35,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-07 12:25:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:35,008 INFO L225 Difference]: With dead ends: 320 [2019-12-07 12:25:35,009 INFO L226 Difference]: Without dead ends: 320 [2019-12-07 12:25:35,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:25:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-07 12:25:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 239. [2019-12-07 12:25:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-07 12:25:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 263 transitions. [2019-12-07 12:25:35,012 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 263 transitions. Word has length 32 [2019-12-07 12:25:35,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:35,012 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 263 transitions. [2019-12-07 12:25:35,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:25:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 263 transitions. [2019-12-07 12:25:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:25:35,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:35,013 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:35,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:35,615 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:25:35,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash 685869664, now seen corresponding path program 1 times [2019-12-07 12:25:35,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:25:35,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832935745] [2019-12-07 12:25:35,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 12:25:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:35,736 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:25:35,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:35,746 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 12:25:35,746 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:35,781 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 12:25:35,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832935745] [2019-12-07 12:25:35,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1320498483] [2019-12-07 12:25:35,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:25:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:35,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:25:35,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:35,914 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 12:25:35,914 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:35,916 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 12:25:35,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24913732] [2019-12-07 12:25:35,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:35,973 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:25:35,974 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:35,978 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 12:25:35,978 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:35,980 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 12:25:35,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:25:35,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2019-12-07 12:25:35,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724300463] [2019-12-07 12:25:35,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:25:35,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:25:35,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:25:35,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:25:35,981 INFO L87 Difference]: Start difference. First operand 239 states and 263 transitions. Second operand 8 states. [2019-12-07 12:25:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:36,354 INFO L93 Difference]: Finished difference Result 257 states and 277 transitions. [2019-12-07 12:25:36,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:25:36,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-07 12:25:36,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:36,356 INFO L225 Difference]: With dead ends: 257 [2019-12-07 12:25:36,356 INFO L226 Difference]: Without dead ends: 257 [2019-12-07 12:25:36,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:25:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-12-07 12:25:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2019-12-07 12:25:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 12:25:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 277 transitions. [2019-12-07 12:25:36,359 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 277 transitions. Word has length 33 [2019-12-07 12:25:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:36,359 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 277 transitions. [2019-12-07 12:25:36,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:25:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 277 transitions. [2019-12-07 12:25:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:25:36,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:36,360 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:36,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 cvc4 --incremental --print-success --lang smt --rewrite-divk,24 mathsat -unsat_core_generation=3 [2019-12-07 12:25:36,962 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr108REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr93REQUIRES_VIOLATION, ULTIMATE.startErr116REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr112REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr100REQUIRES_VIOLATION, ULTIMATE.startErr96REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr104REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr111REQUIRES_VIOLATION, ULTIMATE.startErr130REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr107REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr115REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr92REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr99REQUIRES_VIOLATION, ULTIMATE.startErr131ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr103REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr110REQUIRES_VIOLATION, ULTIMATE.startErr129REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr106REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr121ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr95REQUIRES_VIOLATION, ULTIMATE.startErr114REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr91REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr98REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr117REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr125REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr102REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr109REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr94REQUIRES_VIOLATION, ULTIMATE.startErr90REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr113REQUIRES_VIOLATION, ULTIMATE.startErr118ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr97REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr105REQUIRES_VIOLATION, ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr101REQUIRES_VIOLATION, ULTIMATE.startErr124REQUIRES_VIOLATION]=== [2019-12-07 12:25:36,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:36,963 INFO L82 PathProgramCache]: Analyzing trace with hash -303558338, now seen corresponding path program 2 times [2019-12-07 12:25:36,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:25:36,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088541706] [2019-12-07 12:25:36,964 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 12:25:37,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:25:37,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:25:37,167 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 12:25:37,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:37,171 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_173|], 1=[|v_#valid_196|]} [2019-12-07 12:25:37,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:25:37,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:25:37,176 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:25:37,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:25:37,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:25:37,190 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 5 treesize of output 3 [2019-12-07 12:25:37,190 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:25:37,195 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:25:37,195 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:25:37,195 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-12-07 12:25:37,208 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 12:25:37,208 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:25:37,222 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:25:37,226 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 12:25:37,226 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:25:37,238 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:25:37,239 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 12:25:37,239 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-12-07 12:26:19,114 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-12-07 12:26:19,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088541706] [2019-12-07 12:26:19,115 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 12:26:19,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1964504075] [2019-12-07 12:26:19,115 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:26:19,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:26:19,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:26:19,388 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 12:26:19,389 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:19,390 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken [2019-12-07 12:26:19,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277286431] [2019-12-07 12:26:19,390 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3db63e5-091d-481b-8f67-76a3c3ec6031/bin/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:26:19,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:26:19,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:26:19,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 12:26:19,475 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:19,476 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@1333a8ea [2019-12-07 12:26:19,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:19,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 12:26:19,476 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 12:26:19,476 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:26:20,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 mathsat -unsat_core_generation=3,28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:26:20,095 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 12:26:20,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:26:20 BoogieIcfgContainer [2019-12-07 12:26:20,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:26:20,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:26:20,096 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:26:20,096 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:26:20,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:14:57" (3/4) ... [2019-12-07 12:26:20,099 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:26:20,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:26:20,100 INFO L168 Benchmark]: Toolchain (without parser) took 684199.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 63.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:20,100 INFO L168 Benchmark]: CDTParser took 0.18 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 12:26:20,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:20,101 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.33 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:20,101 INFO L168 Benchmark]: Boogie Preprocessor took 39.73 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 12:26:20,101 INFO L168 Benchmark]: RCFGBuilder took 968.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:20,101 INFO L168 Benchmark]: TraceAbstraction took 682788.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -73.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:26:20,102 INFO L168 Benchmark]: Witness Printer took 3.33 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 12:26:20,103 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 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.33 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.73 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 968.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 682788.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -73.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.33 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 548]: 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: [L586] struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR \read(**pointerToList) [L577] node->next = *pointerToList [L578] EXPR \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] Data data = malloc(sizeof *data); [L545] data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND TRUE counter < 20 [L548] EXPR data->array [L548] data->array[counter] = __VERIFIER_nondet_int() [L547] counter++ [L547] COND TRUE counter < 20 [L548] EXPR data->array [L548] data->array[counter] = __VERIFIER_nondet_int() [L547] counter++ [L547] COND TRUE counter < 20 [L548] EXPR data->array [L548] data->array[counter] = __VERIFIER_nondet_int() [L547] counter++ [L547] COND TRUE counter < 20 [L548] EXPR data->array [L548] data->array[counter] = __VERIFIER_nondet_int() [L547] counter++ [L547] COND TRUE counter < 20 [L548] EXPR data->array [L548] data->array[counter] = __VERIFIER_nondet_int() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 265 locations, 132 error locations. Result: UNKNOWN, OverallTime: 682.7s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 78.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2387 SDtfs, 4783 SDslu, 4930 SDs, 0 SdLazy, 5009 SolverSat, 477 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 63.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 984 GetRequests, 857 SyntacticMatches, 16 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 61.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 1215 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 554.0s InterpolantComputationTime, 501 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 952 ConstructedInterpolants, 43 QuantifiedInterpolants, 157074 SizeOfPredicates, 159 NumberOfNonLiveVariables, 2400 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 50 InterpolantComputations, 24 PerfectInterpolantSequences, 34/162 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...