./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.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_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 66b29305919472944c8da442930a10657496a294 ........................................................................................................................................ 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_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 66b29305919472944c8da442930a10657496a294 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:58:38,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:58:38,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:58:38,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:58:38,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:58:38,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:58:38,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:58:38,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:58:38,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:58:38,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:58:38,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:58:38,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:58:38,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:58:38,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:58:38,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:58:38,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:58:38,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:58:38,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:58:38,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:58:38,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:58:38,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:58:38,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:58:38,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:58:38,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:58:38,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:58:38,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:58:38,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:58:38,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:58:38,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:58:38,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:58:38,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:58:38,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:58:38,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:58:38,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:58:38,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:58:38,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:58:38,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:58:38,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:58:38,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:58:38,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:58:38,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:58:38,131 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 20:58:38,142 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:58:38,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:58:38,142 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:58:38,143 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:58:38,143 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:58:38,143 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:58:38,143 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:58:38,143 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:58:38,143 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:58:38,143 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:58:38,143 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:58:38,144 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:58:38,144 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:58:38,144 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:58:38,144 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:58:38,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 20:58:38,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 20:58:38,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:58:38,145 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:58:38,145 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 20:58:38,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:58:38,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:58:38,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:58:38,145 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 20:58:38,145 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 20:58:38,146 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 20:58:38,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:58:38,146 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:58:38,146 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:58:38,146 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:58:38,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:58:38,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:58:38,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:58:38,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:58:38,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:58:38,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:58:38,147 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:58:38,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:58:38,147 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:58:38,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:58:38,147 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_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 -> 66b29305919472944c8da442930a10657496a294 [2019-12-07 20:58:38,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:58:38,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:58:38,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:58:38,258 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:58:38,258 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:58:38,258 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2019-12-07 20:58:38,295 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/data/947202689/623d1a714e3c4b14b43d48a437bffe0a/FLAG27231c33e [2019-12-07 20:58:38,731 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:58:38,732 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2019-12-07 20:58:38,741 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/data/947202689/623d1a714e3c4b14b43d48a437bffe0a/FLAG27231c33e [2019-12-07 20:58:38,750 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/data/947202689/623d1a714e3c4b14b43d48a437bffe0a [2019-12-07 20:58:38,751 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:58:38,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:58:38,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:58:38,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:58:38,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:58:38,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:58:38" (1/1) ... [2019-12-07 20:58:38,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9050c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:38, skipping insertion in model container [2019-12-07 20:58:38,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:58:38" (1/1) ... [2019-12-07 20:58:38,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:58:38,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:58:39,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:58:39,016 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 20:58:39,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@39c23d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:39, skipping insertion in model container [2019-12-07 20:58:39,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:58:39,017 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2019-12-07 20:58:39,019 INFO L168 Benchmark]: Toolchain (without parser) took 265.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:58:39,020 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:58:39,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:58:39,022 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). Peak memory consumption was 18.3 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 20:58:40,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:58:40,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:58:40,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:58:40,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:58:40,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:58:40,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:58:40,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:58:40,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:58:40,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:58:40,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:58:40,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:58:40,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:58:40,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:58:40,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:58:40,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:58:40,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:58:40,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:58:40,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:58:40,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:58:40,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:58:40,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:58:40,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:58:40,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:58:40,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:58:40,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:58:40,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:58:40,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:58:40,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:58:40,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:58:40,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:58:40,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:58:40,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:58:40,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:58:40,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:58:40,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:58:40,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:58:40,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:58:40,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:58:40,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:58:40,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:58:40,150 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 20:58:40,160 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:58:40,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:58:40,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:58:40,161 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:58:40,161 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:58:40,161 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:58:40,162 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:58:40,162 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:58:40,162 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:58:40,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 20:58:40,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 20:58:40,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:58:40,163 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:58:40,163 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 20:58:40,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:58:40,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:58:40,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:58:40,163 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 20:58:40,163 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 20:58:40,164 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 20:58:40,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:58:40,164 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:58:40,164 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 20:58:40,164 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 20:58:40,164 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:58:40,164 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:58:40,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:58:40,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 20:58:40,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:58:40,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:58:40,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:58:40,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:58:40,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:58:40,165 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 20:58:40,165 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 20:58:40,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:58:40,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:58:40,166 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_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 -> 66b29305919472944c8da442930a10657496a294 [2019-12-07 20:58:40,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:58:40,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:58:40,339 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:58:40,340 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:58:40,341 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:58:40,341 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2019-12-07 20:58:40,379 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/data/967c73e40/116d6f0996c54aab92866c4cf5434117/FLAG3b5f42b49 [2019-12-07 20:58:40,798 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:58:40,798 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2019-12-07 20:58:40,807 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/data/967c73e40/116d6f0996c54aab92866c4cf5434117/FLAG3b5f42b49 [2019-12-07 20:58:41,160 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/bin/utaipan/data/967c73e40/116d6f0996c54aab92866c4cf5434117 [2019-12-07 20:58:41,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:58:41,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:58:41,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:58:41,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:58:41,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:58:41,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:58:41" (1/1) ... [2019-12-07 20:58:41,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ea2d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:41, skipping insertion in model container [2019-12-07 20:58:41,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:58:41" (1/1) ... [2019-12-07 20:58:41,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:58:41,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:58:41,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:58:41,413 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 20:58:41,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:58:41,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:58:41,444 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:58:41,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:58:41,507 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:58:41,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:41 WrapperNode [2019-12-07 20:58:41,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:58:41,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:58:41,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:58:41,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:58:41,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:41" (1/1) ... [2019-12-07 20:58:41,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:41" (1/1) ... [2019-12-07 20:58:41,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:58:41,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:58:41,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:58:41,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:58:41,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:41" (1/1) ... [2019-12-07 20:58:41,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:41" (1/1) ... [2019-12-07 20:58:41,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:41" (1/1) ... [2019-12-07 20:58:41,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:41" (1/1) ... [2019-12-07 20:58:41,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:41" (1/1) ... [2019-12-07 20:58:41,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:41" (1/1) ... [2019-12-07 20:58:41,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:41" (1/1) ... [2019-12-07 20:58:41,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:58:41,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:58:41,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:58:41,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:58:41,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 20:58:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 20:58:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 20:58:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:58:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 20:58:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 20:58:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:58:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 20:58:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 20:58:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:58:41,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:58:42,506 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:58:42,507 INFO L287 CfgBuilder]: Removed 18 assume(true) statements. [2019-12-07 20:58:42,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:58:42 BoogieIcfgContainer [2019-12-07 20:58:42,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:58:42,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:58:42,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:58:42,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:58:42,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:58:41" (1/3) ... [2019-12-07 20:58:42,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c7517c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:58:42, skipping insertion in model container [2019-12-07 20:58:42,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:58:41" (2/3) ... [2019-12-07 20:58:42,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c7517c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:58:42, skipping insertion in model container [2019-12-07 20:58:42,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:58:42" (3/3) ... [2019-12-07 20:58:42,513 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.i [2019-12-07 20:58:42,519 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:58:42,524 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 132 error locations. [2019-12-07 20:58:42,532 INFO L249 AbstractCegarLoop]: Starting to check reachability of 132 error locations. [2019-12-07 20:58:42,545 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:58:42,545 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 20:58:42,545 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:58:42,545 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:58:42,545 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:58:42,546 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:58:42,546 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:58:42,546 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:58:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states. [2019-12-07 20:58:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 20:58:42,567 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:58:42,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 20:58:42,568 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 20:58:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:58:42,572 INFO L82 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2019-12-07 20:58:42,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:58:42,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202585243] [2019-12-07 20:58:42,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 20:58:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:58:42,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:58:42,639 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:58:42,683 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 20:58:42,684 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:42,690 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:42,690 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:58:42,690 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 20:58:42,717 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:42,718 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 20:58:42,718 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:42,736 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 20:58:42,736 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 20:58:42,737 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-12-07 20:58:42,750 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 20:58:42,750 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:58:42,761 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 20:58:42,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202585243] [2019-12-07 20:58:42,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:58:42,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 20:58:42,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254534634] [2019-12-07 20:58:42,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:58:42,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:58:42,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:58:42,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:58:42,778 INFO L87 Difference]: Start difference. First operand 265 states. Second operand 4 states. [2019-12-07 20:58:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:58:43,334 INFO L93 Difference]: Finished difference Result 283 states and 301 transitions. [2019-12-07 20:58:43,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:58:43,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 20:58:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:58:43,346 INFO L225 Difference]: With dead ends: 283 [2019-12-07 20:58:43,346 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 20:58:43,347 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 20:58:43,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 20:58:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 255. [2019-12-07 20:58:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 20:58:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 272 transitions. [2019-12-07 20:58:43,387 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 272 transitions. Word has length 4 [2019-12-07 20:58:43,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:58:43,388 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 272 transitions. [2019-12-07 20:58:43,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:58:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 272 transitions. [2019-12-07 20:58:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 20:58:43,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:58:43,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 20:58:43,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 20:58:43,592 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 20:58:43,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:58:43,593 INFO L82 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2019-12-07 20:58:43,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:58:43,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553108104] [2019-12-07 20:58:43,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 20:58:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:58:43,677 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 20:58:43,678 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:58:43,684 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 20:58:43,684 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:43,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:43,693 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 20:58:43,693 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:43,699 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:43,699 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:58:43,699 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 20:58:43,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:58:43,719 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 20:58:43,720 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:43,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:43,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:58:43,738 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 20:58:43,738 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:43,746 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:43,747 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 20:58:43,747 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:16 [2019-12-07 20:58:43,758 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 20:58:43,758 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:58:43,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:58:43,875 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 20:58:43,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553108104] [2019-12-07 20:58:43,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:58:43,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 20:58:43,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772260128] [2019-12-07 20:58:43,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:58:43,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:58:43,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:58:43,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:58:43,878 INFO L87 Difference]: Start difference. First operand 255 states and 272 transitions. Second operand 6 states. [2019-12-07 20:58:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:58:56,101 INFO L93 Difference]: Finished difference Result 395 states and 416 transitions. [2019-12-07 20:58:56,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:58:56,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-12-07 20:58:56,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:58:56,105 INFO L225 Difference]: With dead ends: 395 [2019-12-07 20:58:56,105 INFO L226 Difference]: Without dead ends: 395 [2019-12-07 20:58:56,106 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 20:58:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-12-07 20:58:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 266. [2019-12-07 20:58:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 20:58:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 290 transitions. [2019-12-07 20:58:56,119 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 290 transitions. Word has length 4 [2019-12-07 20:58:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:58:56,119 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 290 transitions. [2019-12-07 20:58:56,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:58:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 290 transitions. [2019-12-07 20:58:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:58:56,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:58:56,119 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 20:58:56,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 20:58:56,321 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 20:58:56,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:58:56,322 INFO L82 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2019-12-07 20:58:56,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:58:56,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534411119] [2019-12-07 20:58:56,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 20:58:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:58:56,412 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:58:56,413 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:58:56,418 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 20:58:56,419 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:56,421 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:56,421 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:58:56,421 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 20:58:56,425 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 20:58:56,425 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:58:56,426 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 20:58:56,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534411119] [2019-12-07 20:58:56,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:58:56,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 20:58:56,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293622166] [2019-12-07 20:58:56,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:58:56,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:58:56,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:58:56,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:58:56,427 INFO L87 Difference]: Start difference. First operand 266 states and 290 transitions. Second operand 3 states. [2019-12-07 20:58:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:58:56,814 INFO L93 Difference]: Finished difference Result 279 states and 299 transitions. [2019-12-07 20:58:56,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:58:56,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 20:58:56,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:58:56,815 INFO L225 Difference]: With dead ends: 279 [2019-12-07 20:58:56,815 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 20:58:56,815 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 20:58:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 20:58:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 262. [2019-12-07 20:58:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 20:58:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 284 transitions. [2019-12-07 20:58:56,822 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 284 transitions. Word has length 5 [2019-12-07 20:58:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:58:56,822 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 284 transitions. [2019-12-07 20:58:56,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:58:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 284 transitions. [2019-12-07 20:58:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:58:56,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:58:56,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 20:58:57,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 20:58:57,023 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 20:58:57,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:58:57,024 INFO L82 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2019-12-07 20:58:57,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:58:57,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623086649] [2019-12-07 20:58:57,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 20:58:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:58:57,055 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:58:57,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:58:57,064 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 20:58:57,065 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:57,069 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:57,070 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:58:57,070 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 20:58:57,078 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 20:58:57,078 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:58:57,119 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 20:58:57,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623086649] [2019-12-07 20:58:57,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:58:57,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 20:58:57,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205186531] [2019-12-07 20:58:57,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:58:57,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:58:57,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:58:57,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:58:57,121 INFO L87 Difference]: Start difference. First operand 262 states and 284 transitions. Second operand 4 states. [2019-12-07 20:58:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:58:58,390 INFO L93 Difference]: Finished difference Result 407 states and 437 transitions. [2019-12-07 20:58:58,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:58:58,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 20:58:58,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:58:58,394 INFO L225 Difference]: With dead ends: 407 [2019-12-07 20:58:58,394 INFO L226 Difference]: Without dead ends: 407 [2019-12-07 20:58:58,394 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 20:58:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-12-07 20:58:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 264. [2019-12-07 20:58:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-12-07 20:58:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 286 transitions. [2019-12-07 20:58:58,402 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 286 transitions. Word has length 5 [2019-12-07 20:58:58,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:58:58,402 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 286 transitions. [2019-12-07 20:58:58,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:58:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 286 transitions. [2019-12-07 20:58:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:58:58,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:58:58,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:58:58,603 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 20:58:58,605 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 20:58:58,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:58:58,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1328641074, now seen corresponding path program 1 times [2019-12-07 20:58:58,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:58:58,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156532614] [2019-12-07 20:58:58,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 20:58:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:58:58,699 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:58:58,700 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:58:58,705 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 20:58:58,705 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:58:58,707 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 20:58:58,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156532614] [2019-12-07 20:58:58,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:58:58,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 20:58:58,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238495969] [2019-12-07 20:58:58,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:58:58,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:58:58,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:58:58,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:58:58,709 INFO L87 Difference]: Start difference. First operand 264 states and 286 transitions. Second operand 3 states. [2019-12-07 20:58:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:58:58,727 INFO L93 Difference]: Finished difference Result 255 states and 275 transitions. [2019-12-07 20:58:58,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:58:58,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 20:58:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:58:58,729 INFO L225 Difference]: With dead ends: 255 [2019-12-07 20:58:58,729 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 20:58:58,729 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 20:58:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 20:58:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-12-07 20:58:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 20:58:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 275 transitions. [2019-12-07 20:58:58,733 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 275 transitions. Word has length 10 [2019-12-07 20:58:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:58:58,733 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 275 transitions. [2019-12-07 20:58:58,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:58:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 275 transitions. [2019-12-07 20:58:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:58:58,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:58:58,734 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:58:58,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 20:58:58,935 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 20:58:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:58:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1328508074, now seen corresponding path program 1 times [2019-12-07 20:58:58,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:58:58,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033339340] [2019-12-07 20:58:58,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 20:58:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:58:59,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 20:58:59,014 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:58:59,018 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 20:58:59,019 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:59,025 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:59,025 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:58:59,025 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-12-07 20:58:59,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:59,040 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 20:58:59,041 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:59,047 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:59,047 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:58:59,047 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2019-12-07 20:58:59,066 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 20:58:59,067 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:59,084 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:59,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 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 20:58:59,089 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:59,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:59,105 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 20:58:59,105 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:15 [2019-12-07 20:58:59,118 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 20:58:59,119 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:59,126 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:59,128 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 20:58:59,128 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:58:59,131 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:58:59,131 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 20:58:59,131 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-12-07 20:58:59,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 20:58:59,140 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:59:01,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:59:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:59:01,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033339340] [2019-12-07 20:59:01,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:59:01,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2019-12-07 20:59:01,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348935819] [2019-12-07 20:59:01,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:59:01,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:59:01,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:59:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2019-12-07 20:59:01,336 INFO L87 Difference]: Start difference. First operand 255 states and 275 transitions. Second operand 8 states. [2019-12-07 20:59:02,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:59:02,591 INFO L93 Difference]: Finished difference Result 266 states and 286 transitions. [2019-12-07 20:59:02,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:59:02,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-12-07 20:59:02,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:59:02,593 INFO L225 Difference]: With dead ends: 266 [2019-12-07 20:59:02,593 INFO L226 Difference]: Without dead ends: 266 [2019-12-07 20:59:02,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=30, Invalid=59, Unknown=1, NotChecked=0, Total=90 [2019-12-07 20:59:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-07 20:59:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 261. [2019-12-07 20:59:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-12-07 20:59:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 281 transitions. [2019-12-07 20:59:02,597 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 281 transitions. Word has length 10 [2019-12-07 20:59:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:59:02,597 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 281 transitions. [2019-12-07 20:59:02,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:59:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 281 transitions. [2019-12-07 20:59:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:59:02,597 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:02,597 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:59:02,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 20:59:02,799 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 20:59:02,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:02,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1761805906, now seen corresponding path program 1 times [2019-12-07 20:59:02,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:59:02,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013531679] [2019-12-07 20:59:02,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 20:59:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:02,887 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:59:02,887 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:59:02,901 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 20:59:02,902 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 20:59:02,902 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:02,908 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:02,908 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 20:59:02,909 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-12-07 20:59:02,916 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 20:59:02,916 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:59:02,922 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 20:59:02,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013531679] [2019-12-07 20:59:02,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:59:02,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 20:59:02,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537149644] [2019-12-07 20:59:02,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:59:02,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:59:02,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:59:02,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:59:02,923 INFO L87 Difference]: Start difference. First operand 261 states and 281 transitions. Second operand 4 states. [2019-12-07 20:59:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:59:03,417 INFO L93 Difference]: Finished difference Result 286 states and 310 transitions. [2019-12-07 20:59:03,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:59:03,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:59:03,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:59:03,419 INFO L225 Difference]: With dead ends: 286 [2019-12-07 20:59:03,419 INFO L226 Difference]: Without dead ends: 286 [2019-12-07 20:59:03,419 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 20:59:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-12-07 20:59:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 235. [2019-12-07 20:59:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 20:59:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 255 transitions. [2019-12-07 20:59:03,423 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 255 transitions. Word has length 11 [2019-12-07 20:59:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:59:03,423 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 255 transitions. [2019-12-07 20:59:03,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:59:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 255 transitions. [2019-12-07 20:59:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:59:03,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:03,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:59:03,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 20:59:03,626 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 20:59:03,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:03,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1761805907, now seen corresponding path program 1 times [2019-12-07 20:59:03,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:59:03,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687119364] [2019-12-07 20:59:03,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 20:59:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:03,701 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:59:03,702 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:59:03,705 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_149|], 1=[|v_#valid_169|]} [2019-12-07 20:59:03,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:59:03,709 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 20:59:03,709 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:03,717 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:03,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:59:03,721 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 20:59:03,722 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:03,728 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:03,728 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 20:59:03,729 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-12-07 20:59:03,737 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 20:59:03,737 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:59:03,775 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 20:59:03,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687119364] [2019-12-07 20:59:03,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:59:03,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 20:59:03,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589921708] [2019-12-07 20:59:03,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:59:03,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:59:03,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:59:03,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:59:03,776 INFO L87 Difference]: Start difference. First operand 235 states and 255 transitions. Second operand 4 states. [2019-12-07 20:59:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:59:04,996 INFO L93 Difference]: Finished difference Result 369 states and 398 transitions. [2019-12-07 20:59:04,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:59:04,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:59:04,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:59:04,999 INFO L225 Difference]: With dead ends: 369 [2019-12-07 20:59:04,999 INFO L226 Difference]: Without dead ends: 369 [2019-12-07 20:59:04,999 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 20:59:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-07 20:59:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 217. [2019-12-07 20:59:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-12-07 20:59:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 237 transitions. [2019-12-07 20:59:05,003 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 237 transitions. Word has length 11 [2019-12-07 20:59:05,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:59:05,003 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 237 transitions. [2019-12-07 20:59:05,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:59:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 237 transitions. [2019-12-07 20:59:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:59:05,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:05,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:59:05,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 20:59:05,205 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 20:59:05,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:05,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2003218563, now seen corresponding path program 1 times [2019-12-07 20:59:05,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:59:05,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878404132] [2019-12-07 20:59:05,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 20:59:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:05,337 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:59:05,338 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:59:05,347 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 20:59:05,348 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 20:59:05,348 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:05,351 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:05,352 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 20:59:05,352 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 20:59:05,361 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 20:59:05,361 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:05,367 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:05,367 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 20:59:05,368 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 20:59:05,378 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 20:59:05,378 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:05,380 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:05,380 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 20:59:05,381 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-12-07 20:59:05,387 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 20:59:05,387 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:59:05,388 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 20:59:05,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878404132] [2019-12-07 20:59:05,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:59:05,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 20:59:05,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493510378] [2019-12-07 20:59:05,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:59:05,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:59:05,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:59:05,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:59:05,390 INFO L87 Difference]: Start difference. First operand 217 states and 237 transitions. Second operand 5 states. [2019-12-07 20:59:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:59:06,364 INFO L93 Difference]: Finished difference Result 324 states and 358 transitions. [2019-12-07 20:59:06,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:59:06,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 20:59:06,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:59:06,366 INFO L225 Difference]: With dead ends: 324 [2019-12-07 20:59:06,366 INFO L226 Difference]: Without dead ends: 324 [2019-12-07 20:59:06,366 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 20:59:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-12-07 20:59:06,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 223. [2019-12-07 20:59:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-12-07 20:59:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 247 transitions. [2019-12-07 20:59:06,370 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 247 transitions. Word has length 15 [2019-12-07 20:59:06,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:59:06,370 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 247 transitions. [2019-12-07 20:59:06,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:59:06,370 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2019-12-07 20:59:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:59:06,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:06,371 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:59:06,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 20:59:06,572 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 20:59:06,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:06,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2003218562, now seen corresponding path program 1 times [2019-12-07 20:59:06,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:59:06,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198572151] [2019-12-07 20:59:06,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 20:59:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:06,663 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:59:06,664 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:59:06,678 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:06,678 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 20:59:06,679 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:06,696 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 20:59:06,697 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 20:59:06,697 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-12-07 20:59:06,707 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 20:59:06,707 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:06,718 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:06,721 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 20:59:06,721 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:06,730 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:06,730 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 20:59:06,730 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-12-07 20:59:06,762 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 20:59:06,762 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:06,774 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:06,777 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 20:59:06,777 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:06,782 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:06,782 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 20:59:06,782 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:12 [2019-12-07 20:59:06,796 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 20:59:06,796 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:59:07,112 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 20:59:07,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198572151] [2019-12-07 20:59:07,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:59:07,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 20:59:07,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965490730] [2019-12-07 20:59:07,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:59:07,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:59:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:59:07,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:59:07,113 INFO L87 Difference]: Start difference. First operand 223 states and 247 transitions. Second operand 10 states. [2019-12-07 20:59:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:59:10,871 INFO L93 Difference]: Finished difference Result 377 states and 406 transitions. [2019-12-07 20:59:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:59:10,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-07 20:59:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:59:10,873 INFO L225 Difference]: With dead ends: 377 [2019-12-07 20:59:10,873 INFO L226 Difference]: Without dead ends: 377 [2019-12-07 20:59:10,874 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 20:59:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-12-07 20:59:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 223. [2019-12-07 20:59:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-12-07 20:59:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 243 transitions. [2019-12-07 20:59:10,878 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 243 transitions. Word has length 15 [2019-12-07 20:59:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:59:10,878 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 243 transitions. [2019-12-07 20:59:10,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:59:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 243 transitions. [2019-12-07 20:59:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:59:10,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:10,879 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 20:59:11,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 20:59:11,081 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 20:59:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:11,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1799893576, now seen corresponding path program 1 times [2019-12-07 20:59:11,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:59:11,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279361082] [2019-12-07 20:59:11,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 20:59:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:11,213 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:59:11,214 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:59:11,224 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 20:59:11,224 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 20:59:11,225 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:11,229 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:11,229 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:59:11,230 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2019-12-07 20:59:11,240 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 20:59:11,240 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:11,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:11,250 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 20:59:11,251 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-12-07 21:00:12,309 WARN L192 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-07 21:00:12,310 INFO L343 Elim1Store]: treesize reduction 421, result has 38.3 percent of original size [2019-12-07 21:00:12,310 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 21:00:12,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:12,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:12,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:00:12,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:00:12,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:00:12,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:12,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:00:12,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:00:12,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:00:12,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:12,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:00:12,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:00:12,317 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-12-07 21:00:12,441 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 17 [2019-12-07 21:00:12,441 INFO L614 ElimStorePlain]: treesize reduction 1178, result has 2.2 percent of original size [2019-12-07 21:00:12,441 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 21:00:12,441 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:137, output treesize:27 [2019-12-07 21:00:12,452 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 21:00:12,452 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:00:12,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:00:12,460 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 21:00:12,460 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-12-07 21:00:12,478 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 21:00:12,478 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:00:12,503 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 21:00:12,540 INFO L614 ElimStorePlain]: treesize reduction 132, result has 27.1 percent of original size [2019-12-07 21:00:12,540 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 21:00:12,540 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:49 [2019-12-07 21:00:14,185 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:00:15,744 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 227 DAG size of output: 64 [2019-12-07 21:00:15,745 INFO L614 ElimStorePlain]: treesize reduction 9663, result has 1.6 percent of original size [2019-12-07 21:00:15,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:00:15,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:00:15,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:00:15,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:00:15,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:00:15,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:00:15,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:00:15,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:00:15,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:00:15,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:00:15,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:00:15,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:00:15,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:00:15,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:00:15,789 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 21:00:15,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:69, output treesize:830 [2019-12-07 21:00:15,877 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 21:00:15,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279361082] [2019-12-07 21:00:15,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [427261105] [2019-12-07 21:00:15,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 21:00:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:16,038 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 21:00:16,039 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:00:16,094 INFO L343 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2019-12-07 21:00:16,095 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 21:00:16,095 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:00:16,123 INFO L614 ElimStorePlain]: treesize reduction 17, result has 58.5 percent of original size [2019-12-07 21:00:16,124 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 21:00:16,124 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2019-12-07 21:00:16,130 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 21:00:16,130 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:00:16,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:00:16,142 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 21:00:16,142 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-12-07 21:01:17,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 21:01:17,154 INFO L343 Elim1Store]: treesize reduction 421, result has 38.3 percent of original size [2019-12-07 21:01:17,155 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 21:01:17,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:17,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:01:17,171 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 31 xjuncts. [2019-12-07 21:01:17,607 WARN L192 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 19 [2019-12-07 21:01:17,607 INFO L614 ElimStorePlain]: treesize reduction 4952, result has 0.6 percent of original size [2019-12-07 21:01:17,607 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 21:01:17,607 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:137, output treesize:29 [2019-12-07 21:01:17,611 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 21:01:17,611 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:01:17,616 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:01:17,616 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 21:01:17,616 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-12-07 21:01:17,618 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 21:01:17,618 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:01:17,621 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 21:01:17,660 INFO L614 ElimStorePlain]: treesize reduction 132, result has 26.3 percent of original size [2019-12-07 21:01:17,660 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 21:01:17,661 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:47 [2019-12-07 21:01:17,752 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:01:19,281 WARN L192 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 227 DAG size of output: 64 [2019-12-07 21:01:19,282 INFO L614 ElimStorePlain]: treesize reduction 9663, result has 1.6 percent of original size [2019-12-07 21:01:19,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:01:19,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:01:19,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:01:19,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:01:19,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:01:19,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:01:19,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:01:19,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:01:19,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:01:19,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:01:19,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:01:19,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:01:19,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:01:19,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:01:19,304 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 21:01:19,304 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:69, output treesize:830 [2019-12-07 21:01:19,345 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 21:01:19,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986760600] [2019-12-07 21:01:19,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 21:01:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:01:19,426 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:01:19,427 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:01:19,438 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 21:01:19,438 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 21:01:19,438 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:01:19,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:01:19,443 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:01:19,443 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2019-12-07 21:01:19,447 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 21:01:19,447 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:01:19,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:01:19,457 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 21:01:19,457 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-12-07 21:02:20,469 WARN L192 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-07 21:02:20,470 INFO L343 Elim1Store]: treesize reduction 421, result has 38.3 percent of original size [2019-12-07 21:02:20,470 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 21:02:20,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:20,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:02:20,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:02:20,472 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 21:02:28,665 WARN L192 SmtUtils]: Spent 8.19 s on a formula simplification. DAG size of input: 52 DAG size of output: 19 [2019-12-07 21:02:28,666 INFO L614 ElimStorePlain]: treesize reduction 493, result has 5.6 percent of original size [2019-12-07 21:02:28,666 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 21:02:28,666 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:137, output treesize:29 [2019-12-07 21:02:28,670 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 21:02:28,670 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:02:28,675 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:02:28,675 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 21:02:28,676 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-12-07 21:02:28,677 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 21:02:28,677 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:02:28,680 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 21:02:28,718 INFO L614 ElimStorePlain]: treesize reduction 132, result has 27.1 percent of original size [2019-12-07 21:02:28,718 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 21:02:28,718 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:49 [2019-12-07 21:02:28,803 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:02:30,300 WARN L192 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 227 DAG size of output: 64 [2019-12-07 21:02:30,300 INFO L614 ElimStorePlain]: treesize reduction 9663, result has 1.6 percent of original size [2019-12-07 21:02:30,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:02:30,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:02:30,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:02:30,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:02:30,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:02:30,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:02:30,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:02:30,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:02:30,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:02:30,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:02:30,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:02:30,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:02:30,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:02:30,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:02:30,323 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 21:02:30,324 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:69, output treesize:830 [2019-12-07 21:02:30,375 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 21:02:30,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:02:30,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6, 6, 5, 6] total 11 [2019-12-07 21:02:30,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138766442] [2019-12-07 21:02:30,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 21:02:30,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:02:30,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 21:02:30,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:02:30,376 INFO L87 Difference]: Start difference. First operand 223 states and 243 transitions. Second operand 12 states. [2019-12-07 21:02:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:33,184 INFO L93 Difference]: Finished difference Result 282 states and 303 transitions. [2019-12-07 21:02:33,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:02:33,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-12-07 21:02:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:33,186 INFO L225 Difference]: With dead ends: 282 [2019-12-07 21:02:33,186 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 21:02:33,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 98 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:02:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 21:02:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 221. [2019-12-07 21:02:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-07 21:02:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 241 transitions. [2019-12-07 21:02:33,189 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 241 transitions. Word has length 20 [2019-12-07 21:02:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:33,189 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 241 transitions. [2019-12-07 21:02:33,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 21:02:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 241 transitions. [2019-12-07 21:02:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:02:33,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:33,190 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 21:02:33,791 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 21:02:33,792 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 21:02:33,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1799893575, now seen corresponding path program 1 times [2019-12-07 21:02:33,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:02:33,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846088095] [2019-12-07 21:02:33,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 21:02:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:33,975 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 21:02:33,976 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:02:33,978 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_157|], 1=[|v_#valid_180|]} [2019-12-07 21:02:33,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:02:33,981 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 21:02:33,982 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:02:33,990 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:02:33,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:02:33,993 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 21:02:33,993 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:02:34,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:02:34,003 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:02:34,003 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-12-07 21:02:34,017 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 21:02:34,017 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:02:34,031 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:02:34,035 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 21:02:34,035 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:02:34,046 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:02:34,047 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 21:02:34,047 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-12-07 21:02:34,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:02:34,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:02:34,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:02:34,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:02:34,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:02:34,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:02:34,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:02:34,134 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 21:02:34,134 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:02:34,179 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:03:35,814 WARN L192 SmtUtils]: Spent 1.03 m on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-07 21:03:35,814 INFO L343 Elim1Store]: treesize reduction 421, result has 38.3 percent of original size [2019-12-07 21:03:35,815 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 21:03:35,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:03:35,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:03:35,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:03:35,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:03:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:03:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:03:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:03:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:03:35,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:03:35,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:03:35,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:03:35,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:03:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:03:35,832 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 19 xjuncts. [2019-12-07 21:03:50,301 WARN L192 SmtUtils]: Spent 14.47 s on a formula simplification. DAG size of input: 131 DAG size of output: 24 [2019-12-07 21:03:50,302 INFO L614 ElimStorePlain]: treesize reduction 4963, result has 0.7 percent of original size [2019-12-07 21:03:50,302 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 21:03:50,302 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:253, output treesize:33 [2019-12-07 21:03:50,339 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 21:03:50,339 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:03:50,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:03:50,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 21:03:50,356 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:03:50,363 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:03:50,364 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 21:03:50,364 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:19 [2019-12-07 21:03:50,389 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 21:03:50,389 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:03:50,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:03:50,741 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 21:03:50,753 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 21:03:51,260 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-12-07 21:03:51,261 INFO L614 ElimStorePlain]: treesize reduction 262, result has 54.0 percent of original size [2019-12-07 21:03:51,271 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 21:03:51,311 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 21:03:51,688 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-12-07 21:03:51,688 INFO L614 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2019-12-07 21:03:51,689 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 21:03:51,689 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2019-12-07 21:03:56,042 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 21:04:01,792 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-07 21:04:01,816 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:06,096 WARN L192 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 159 DAG size of output: 99 [2019-12-07 21:04:06,096 INFO L614 ElimStorePlain]: treesize reduction 10026, result has 4.6 percent of original size [2019-12-07 21:04:06,230 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:19,166 WARN L192 SmtUtils]: Spent 12.93 s on a formula simplification. DAG size of input: 1802 DAG size of output: 90 [2019-12-07 21:04:19,166 INFO L614 ElimStorePlain]: treesize reduction 634715, result has 0.0 percent of original size [2019-12-07 21:04:19,195 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:26,202 WARN L192 SmtUtils]: Spent 7.01 s on a formula simplification. DAG size of input: 412 DAG size of output: 113 [2019-12-07 21:04:26,202 INFO L614 ElimStorePlain]: treesize reduction 31585, result has 0.8 percent of original size [2019-12-07 21:04:26,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:26,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:04:26,303 INFO L534 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 50 dim-0 vars, and 12 xjuncts. [2019-12-07 21:04:26,303 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:523 [2019-12-07 21:04:27,110 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 14 [2019-12-07 21:04:27,114 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 21:04:27,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846088095] [2019-12-07 21:04:27,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [967100829] [2019-12-07 21:04:27,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 21:04:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:27,278 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 21:04:27,279 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:04:27,282 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_159|], 1=[|v_#valid_182|]} [2019-12-07 21:04:27,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:27,285 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 21:04:27,286 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:27,293 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:27,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:27,296 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 21:04:27,297 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:27,302 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:27,302 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:04:27,302 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-12-07 21:04:27,307 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 21:04:27,307 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:27,320 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:27,323 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 21:04:27,323 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:27,334 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:27,334 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 21:04:27,334 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-12-07 21:04:27,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:27,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:27,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:27,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:27,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:27,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:27,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:27,362 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 21:04:27,363 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:27,399 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:28,486 WARN L192 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-07 21:05:28,487 INFO L343 Elim1Store]: treesize reduction 421, result has 38.3 percent of original size [2019-12-07 21:05:28,487 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 21:05:28,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:28,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:05:28,537 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 35 xjuncts. [2019-12-07 21:05:29,078 WARN L192 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 24 [2019-12-07 21:05:29,078 INFO L614 ElimStorePlain]: treesize reduction 8225, result has 0.4 percent of original size [2019-12-07 21:05:29,079 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 21:05:29,079 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:253, output treesize:33 [2019-12-07 21:05:29,097 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 21:05:29,097 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:29,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:29,114 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 21:05:29,114 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:29,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:29,122 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 21:05:29,122 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:19 [2019-12-07 21:05:29,123 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 21:05:29,124 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:05:29,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:29,146 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 21:05:29,174 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 21:05:29,545 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-12-07 21:05:29,546 INFO L614 ElimStorePlain]: treesize reduction 262, result has 47.4 percent of original size [2019-12-07 21:05:29,557 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 21:05:29,567 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 21:05:29,865 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-07 21:05:29,866 INFO L614 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2019-12-07 21:05:29,866 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 21:05:29,866 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2019-12-07 21:05:35,801 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:40,279 WARN L192 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 159 DAG size of output: 98 [2019-12-07 21:05:40,279 INFO L614 ElimStorePlain]: treesize reduction 4836, result has 9.1 percent of original size [2019-12-07 21:05:40,308 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:48,629 WARN L192 SmtUtils]: Spent 8.32 s on a formula simplification. DAG size of input: 419 DAG size of output: 120 [2019-12-07 21:05:48,630 INFO L614 ElimStorePlain]: treesize reduction 31585, result has 1.6 percent of original size [2019-12-07 21:05:48,661 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:52,724 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 249 DAG size of output: 110 [2019-12-07 21:05:52,725 INFO L614 ElimStorePlain]: treesize reduction 2455, result has 9.8 percent of original size [2019-12-07 21:05:52,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:52,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:52,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:52,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:52,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:52,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:52,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:52,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:52,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:52,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:52,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:52,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:52,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:52,799 INFO L534 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 44 dim-0 vars, and 11 xjuncts. [2019-12-07 21:05:52,799 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:499 [2019-12-07 21:05:53,187 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 21:05:53,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420998620] [2019-12-07 21:05:53,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc1e84e7-a496-439c-b111-af1f802fb6fb/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 21:05:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:53,232 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 21:05:53,233 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:05:53,235 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_161|], 1=[|v_#valid_184|]} [2019-12-07 21:05:53,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:05:53,239 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 21:05:53,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:53,247 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:53,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:05:53,250 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 21:05:53,250 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:53,256 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:53,256 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:05:53,256 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-12-07 21:05:53,261 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 21:05:53,261 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:53,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:53,279 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 21:05:53,279 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:53,289 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:53,290 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 21:05:53,290 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-12-07 21:06:54,415 WARN L192 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-07 21:06:54,416 INFO L343 Elim1Store]: treesize reduction 421, result has 38.3 percent of original size [2019-12-07 21:06:54,416 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 21:06:54,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:06:54,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:06:54,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:06:54,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:06:54,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:06:54,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:06:54,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:06:54,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:06:54,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:06:54,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:06:54,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:06:54,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 21:06:54,424 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 11 xjuncts. [2019-12-07 21:07:23,328 WARN L192 SmtUtils]: Spent 28.90 s on a formula simplification. DAG size of input: 121 DAG size of output: 47 [2019-12-07 21:07:23,328 INFO L614 ElimStorePlain]: treesize reduction 4732, result has 2.9 percent of original size [2019-12-07 21:07:23,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:07:23,338 INFO L343 Elim1Store]: treesize reduction 331, result has 0.3 percent of original size [2019-12-07 21:07:23,338 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 21:07:23,338 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:07:23,349 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:07:23,350 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 21:07:23,350 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:253, output treesize:33 [2019-12-07 21:07:23,363 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 21:07:23,364 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:07:23,379 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:07:23,381 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 21:07:23,381 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:07:23,389 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:07:23,389 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 21:07:23,390 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:19 [2019-12-07 21:07:23,391 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 21:07:23,392 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:07:23,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:23,412 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 21:07:23,427 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 21:07:23,911 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-12-07 21:07:23,912 INFO L614 ElimStorePlain]: treesize reduction 262, result has 54.0 percent of original size [2019-12-07 21:07:23,930 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 21:07:23,942 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 21:07:24,294 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-12-07 21:07:24,294 INFO L614 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2019-12-07 21:07:24,295 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 21:07:24,295 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2019-12-07 21:07:28,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:07:33,052 WARN L192 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 277 DAG size of output: 99 [2019-12-07 21:07:33,053 INFO L614 ElimStorePlain]: treesize reduction 41066, result has 1.2 percent of original size [2019-12-07 21:07:33,072 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:07:36,321 WARN L192 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 230 DAG size of output: 93 [2019-12-07 21:07:36,322 INFO L614 ElimStorePlain]: treesize reduction 2455, result has 8.9 percent of original size [2019-12-07 21:07:36,346 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 21:07:43,659 WARN L192 SmtUtils]: Spent 7.31 s on a formula simplification. DAG size of input: 412 DAG size of output: 113 [2019-12-07 21:07:43,660 INFO L614 ElimStorePlain]: treesize reduction 31585, result has 0.8 percent of original size [2019-12-07 21:07:43,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:07:43,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:07:43,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 44 dim-0 vars, and 11 xjuncts. [2019-12-07 21:07:43,734 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:499 [2019-12-07 21:07:44,189 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 21:07:44,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:07:44,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 8, 7, 8] total 14 [2019-12-07 21:07:44,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504282717] [2019-12-07 21:07:44,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 21:07:44,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:07:44,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 21:07:44,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=161, Unknown=2, NotChecked=0, Total=210 [2019-12-07 21:07:44,190 INFO L87 Difference]: Start difference. First operand 221 states and 241 transitions. Second operand 15 states. [2019-12-07 21:07:45,969 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 37 [2019-12-07 21:07:54,087 WARN L192 SmtUtils]: Spent 7.45 s on a formula simplification. DAG size of input: 130 DAG size of output: 95 [2019-12-07 21:08:04,095 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 21:08:05,411 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-12-07 21:08:16,029 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 21:08:16,030 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:100) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:130) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:660) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:279) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:161) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:714) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 31 more [2019-12-07 21:08:16,037 INFO L168 Benchmark]: Toolchain (without parser) took 574873.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 947.0 MB in the beginning and 824.3 MB in the end (delta: 122.8 MB). Peak memory consumption was 306.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:08:16,037 INFO L168 Benchmark]: CDTParser took 0.13 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 21:08:16,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:08:16,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:08:16,038 INFO L168 Benchmark]: Boogie Preprocessor took 32.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:08:16,038 INFO L168 Benchmark]: RCFGBuilder took 927.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 990.6 MB in the end (delta: 92.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:08:16,038 INFO L168 Benchmark]: TraceAbstraction took 573526.35 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 990.6 MB in the beginning and 824.3 MB in the end (delta: 166.4 MB). Peak memory consumption was 234.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:08:16,040 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.13 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 344.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 927.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 990.6 MB in the end (delta: 92.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 573526.35 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 990.6 MB in the beginning and 824.3 MB in the end (delta: 166.4 MB). Peak memory consumption was 234.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...