./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 405f1f88928971d68fe43dfe32aefe8e38a8cf55 ............................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 405f1f88928971d68fe43dfe32aefe8e38a8cf55 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 20:24:48,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 20:24:48,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 20:24:48,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 20:24:48,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 20:24:48,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 20:24:48,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 20:24:48,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 20:24:48,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 20:24:48,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 20:24:48,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 20:24:48,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 20:24:48,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 20:24:48,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 20:24:48,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 20:24:48,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 20:24:48,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 20:24:48,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 20:24:48,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 20:24:48,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 20:24:48,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 20:24:48,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 20:24:48,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 20:24:48,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 20:24:48,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 20:24:48,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 20:24:48,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 20:24:48,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 20:24:48,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 20:24:48,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 20:24:48,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 20:24:48,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 20:24:48,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 20:24:48,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 20:24:48,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 20:24:48,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 20:24:48,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 20:24:48,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 20:24:48,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 20:24:48,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 20:24:48,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 20:24:48,270 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 20:24:48,285 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 20:24:48,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 20:24:48,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 20:24:48,286 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 20:24:48,286 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 20:24:48,286 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 20:24:48,287 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 20:24:48,287 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 20:24:48,287 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 20:24:48,287 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 20:24:48,287 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 20:24:48,287 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 20:24:48,287 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 20:24:48,287 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 20:24:48,287 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 20:24:48,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 20:24:48,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 20:24:48,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 20:24:48,288 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 20:24:48,288 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 20:24:48,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 20:24:48,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 20:24:48,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 20:24:48,289 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 20:24:48,289 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 20:24:48,289 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 20:24:48,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 20:24:48,289 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 20:24:48,289 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 20:24:48,289 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 20:24:48,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 20:24:48,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 20:24:48,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 20:24:48,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 20:24:48,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 20:24:48,290 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 20:24:48,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 20:24:48,290 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 20:24:48,290 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 20:24:48,290 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 -> 405f1f88928971d68fe43dfe32aefe8e38a8cf55 [2020-12-09 20:24:48,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 20:24:48,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 20:24:48,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 20:24:48,492 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 20:24:48,492 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 20:24:48,493 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2020-12-09 20:24:48,543 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/data/e2e8dea44/31511f3002b94ca1a9c941e0cd3e75f1/FLAGf9073ca38 [2020-12-09 20:24:48,956 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 20:24:48,956 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2020-12-09 20:24:48,968 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/data/e2e8dea44/31511f3002b94ca1a9c941e0cd3e75f1/FLAGf9073ca38 [2020-12-09 20:24:48,977 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/data/e2e8dea44/31511f3002b94ca1a9c941e0cd3e75f1 [2020-12-09 20:24:48,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 20:24:48,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 20:24:48,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 20:24:48,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 20:24:48,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 20:24:48,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:24:48" (1/1) ... [2020-12-09 20:24:48,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6bbb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:48, skipping insertion in model container [2020-12-09 20:24:48,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:24:48" (1/1) ... [2020-12-09 20:24:49,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 20:24:49,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 20:24:49,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:24:49,254 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) [2020-12-09 20:24:49,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@310c5394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:49, skipping insertion in model container [2020-12-09 20:24:49,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 20:24:49,255 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2020-12-09 20:24:49,256 INFO L168 Benchmark]: Toolchain (without parser) took 275.36 ms. Allocated memory is still 92.3 MB. Free memory was 49.6 MB in the beginning and 61.2 MB in the end (delta: -11.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 20:24:49,257 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 92.3 MB. Free memory was 67.4 MB in the beginning and 67.3 MB in the end (delta: 115.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 20:24:49,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.09 ms. Allocated memory is still 92.3 MB. Free memory was 71.1 MB in the beginning and 61.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. [2020-12-09 20:24:49,259 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 92.3 MB. Free memory was 67.4 MB in the beginning and 67.3 MB in the end (delta: 115.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 263.09 ms. Allocated memory is still 92.3 MB. Free memory was 71.1 MB in the beginning and 61.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: 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.2.0-7b2dab5 [2020-12-09 20:24:50,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 20:24:50,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 20:24:50,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 20:24:50,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 20:24:50,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 20:24:50,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 20:24:50,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 20:24:50,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 20:24:50,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 20:24:50,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 20:24:50,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 20:24:50,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 20:24:50,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 20:24:50,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 20:24:50,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 20:24:50,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 20:24:50,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 20:24:50,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 20:24:50,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 20:24:50,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 20:24:50,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 20:24:50,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 20:24:50,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 20:24:50,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 20:24:50,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 20:24:50,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 20:24:50,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 20:24:50,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 20:24:50,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 20:24:50,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 20:24:50,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 20:24:50,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 20:24:50,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 20:24:50,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 20:24:50,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 20:24:50,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 20:24:50,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 20:24:50,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 20:24:50,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 20:24:50,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 20:24:50,676 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-12-09 20:24:50,711 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 20:24:50,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 20:24:50,712 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 20:24:50,712 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 20:24:50,713 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 20:24:50,713 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 20:24:50,713 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 20:24:50,713 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 20:24:50,713 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 20:24:50,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 20:24:50,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 20:24:50,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 20:24:50,715 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 20:24:50,715 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 20:24:50,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 20:24:50,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 20:24:50,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 20:24:50,716 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 20:24:50,716 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 20:24:50,716 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 20:24:50,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 20:24:50,717 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 20:24:50,717 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 20:24:50,717 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 20:24:50,717 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 20:24:50,717 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 20:24:50,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 20:24:50,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 20:24:50,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 20:24:50,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 20:24:50,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 20:24:50,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 20:24:50,719 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 20:24:50,719 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 20:24:50,719 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 20:24:50,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 20:24:50,720 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 -> 405f1f88928971d68fe43dfe32aefe8e38a8cf55 [2020-12-09 20:24:50,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 20:24:50,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 20:24:50,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 20:24:50,976 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 20:24:50,977 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 20:24:50,978 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2020-12-09 20:24:51,016 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/data/4f95f57a4/390b506d7a30448989a5821c5a29ad08/FLAG0071751df [2020-12-09 20:24:51,479 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 20:24:51,480 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2020-12-09 20:24:51,490 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/data/4f95f57a4/390b506d7a30448989a5821c5a29ad08/FLAG0071751df [2020-12-09 20:24:51,500 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/data/4f95f57a4/390b506d7a30448989a5821c5a29ad08 [2020-12-09 20:24:51,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 20:24:51,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 20:24:51,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 20:24:51,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 20:24:51,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 20:24:51,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:24:51" (1/1) ... [2020-12-09 20:24:51,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f8706c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:51, skipping insertion in model container [2020-12-09 20:24:51,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:24:51" (1/1) ... [2020-12-09 20:24:51,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 20:24:51,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 20:24:51,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:24:51,805 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-12-09 20:24:51,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 20:24:51,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:24:51,848 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 20:24:51,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:24:51,942 INFO L208 MainTranslator]: Completed translation [2020-12-09 20:24:51,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:51 WrapperNode [2020-12-09 20:24:51,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 20:24:51,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 20:24:51,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 20:24:51,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 20:24:51,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:51" (1/1) ... [2020-12-09 20:24:51,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:51" (1/1) ... [2020-12-09 20:24:51,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 20:24:51,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 20:24:51,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 20:24:51,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 20:24:51,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:51" (1/1) ... [2020-12-09 20:24:51,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:51" (1/1) ... [2020-12-09 20:24:51,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:51" (1/1) ... [2020-12-09 20:24:51,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:51" (1/1) ... [2020-12-09 20:24:52,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:51" (1/1) ... [2020-12-09 20:24:52,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:51" (1/1) ... [2020-12-09 20:24:52,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:51" (1/1) ... [2020-12-09 20:24:52,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 20:24:52,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 20:24:52,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 20:24:52,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 20:24:52,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 [2020-12-09 20:24:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 20:24:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 20:24:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 20:24:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 20:24:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 20:24:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 20:24:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 20:24:52,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 20:24:52,461 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 20:24:52,462 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2020-12-09 20:24:52,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:24:52 BoogieIcfgContainer [2020-12-09 20:24:52,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 20:24:52,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 20:24:52,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 20:24:52,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 20:24:52,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:24:51" (1/3) ... [2020-12-09 20:24:52,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d497046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:24:52, skipping insertion in model container [2020-12-09 20:24:52,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:24:51" (2/3) ... [2020-12-09 20:24:52,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d497046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:24:52, skipping insertion in model container [2020-12-09 20:24:52,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:24:52" (3/3) ... [2020-12-09 20:24:52,471 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test10-1.i [2020-12-09 20:24:52,484 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 20:24:52,487 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 34 error locations. [2020-12-09 20:24:52,494 INFO L253 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2020-12-09 20:24:52,508 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 20:24:52,508 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 20:24:52,508 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 20:24:52,508 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 20:24:52,508 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 20:24:52,508 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 20:24:52,508 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 20:24:52,508 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 20:24:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2020-12-09 20:24:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 20:24:52,523 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:24:52,523 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 20:24:52,524 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:24:52,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:24:52,527 INFO L82 PathProgramCache]: Analyzing trace with hash 889508809, now seen corresponding path program 1 times [2020-12-09 20:24:52,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:24:52,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835113695] [2020-12-09 20:24:52,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 [2020-12-09 20:24:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:24:52,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 20:24:52,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:24:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:24:52,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:24:52,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835113695] [2020-12-09 20:24:52,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:24:52,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:24:52,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428016372] [2020-12-09 20:24:52,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 20:24:52,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:24:52,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 20:24:52,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 20:24:52,655 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2020-12-09 20:24:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:24:52,890 INFO L93 Difference]: Finished difference Result 283 states and 297 transitions. [2020-12-09 20:24:52,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 20:24:52,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 20:24:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:24:52,901 INFO L225 Difference]: With dead ends: 283 [2020-12-09 20:24:52,901 INFO L226 Difference]: Without dead ends: 275 [2020-12-09 20:24:52,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:24:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-12-09 20:24:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 76. [2020-12-09 20:24:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-09 20:24:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2020-12-09 20:24:52,937 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 6 [2020-12-09 20:24:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:24:52,938 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2020-12-09 20:24:52,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 20:24:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-12-09 20:24:52,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 20:24:52,938 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:24:52,938 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 20:24:53,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 20:24:53,141 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:24:53,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:24:53,144 INFO L82 PathProgramCache]: Analyzing trace with hash 889568391, now seen corresponding path program 1 times [2020-12-09 20:24:53,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:24:53,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717428868] [2020-12-09 20:24:53,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 [2020-12-09 20:24:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:24:53,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 20:24:53,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:24:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:24:53,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:24:53,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717428868] [2020-12-09 20:24:53,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:24:53,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 20:24:53,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217356574] [2020-12-09 20:24:53,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 20:24:53,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:24:53,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 20:24:53,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 20:24:53,316 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 3 states. [2020-12-09 20:24:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:24:53,462 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2020-12-09 20:24:53,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 20:24:53,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-12-09 20:24:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:24:53,463 INFO L225 Difference]: With dead ends: 144 [2020-12-09 20:24:53,463 INFO L226 Difference]: Without dead ends: 143 [2020-12-09 20:24:53,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 20:24:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-09 20:24:53,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 74. [2020-12-09 20:24:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-12-09 20:24:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2020-12-09 20:24:53,469 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 6 [2020-12-09 20:24:53,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:24:53,469 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2020-12-09 20:24:53,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 20:24:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-12-09 20:24:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 20:24:53,469 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:24:53,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:24:53,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 20:24:53,672 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:24:53,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:24:53,674 INFO L82 PathProgramCache]: Analyzing trace with hash 119444428, now seen corresponding path program 1 times [2020-12-09 20:24:53,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:24:53,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712825850] [2020-12-09 20:24:53,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 [2020-12-09 20:24:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:24:53,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 20:24:53,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:24:53,789 INFO L382 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 [2020-12-09 20:24:53,789 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:24:53,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:24:53,791 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:24:53,792 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:24:53,830 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:24:53,830 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-12-09 20:24:53,835 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:24:53,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:24:53,846 INFO L547 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. [2020-12-09 20:24:53,846 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2020-12-09 20:24:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:24:53,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:24:53,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712825850] [2020-12-09 20:24:53,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:24:53,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:24:53,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956611516] [2020-12-09 20:24:53,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:24:53,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:24:53,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:24:53,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:24:53,872 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 5 states. [2020-12-09 20:24:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:24:54,300 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2020-12-09 20:24:54,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 20:24:54,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-12-09 20:24:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:24:54,303 INFO L225 Difference]: With dead ends: 200 [2020-12-09 20:24:54,303 INFO L226 Difference]: Without dead ends: 200 [2020-12-09 20:24:54,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 20:24:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-12-09 20:24:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 79. [2020-12-09 20:24:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 20:24:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2020-12-09 20:24:54,310 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 8 [2020-12-09 20:24:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:24:54,310 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2020-12-09 20:24:54,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:24:54,310 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2020-12-09 20:24:54,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 20:24:54,310 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:24:54,310 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:24:54,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 20:24:54,512 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:24:54,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:24:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash 119444429, now seen corresponding path program 1 times [2020-12-09 20:24:54,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:24:54,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362151736] [2020-12-09 20:24:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 [2020-12-09 20:24:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:24:54,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 20:24:54,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:24:54,583 INFO L382 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 [2020-12-09 20:24:54,583 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:24:54,590 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:24:54,594 INFO L382 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 [2020-12-09 20:24:54,595 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:24:54,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:24:54,602 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:24:54,603 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 20:24:54,652 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:24:54,652 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 20:24:54,654 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:24:54,664 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:24:54,668 INFO L382 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 [2020-12-09 20:24:54,669 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:24:54,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:24:54,682 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:24:54,682 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2020-12-09 20:24:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:24:54,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:24:54,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362151736] [2020-12-09 20:24:54,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:24:54,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 20:24:54,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544545364] [2020-12-09 20:24:54,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:24:54,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:24:54,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:24:54,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:24:54,697 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 6 states. [2020-12-09 20:24:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:24:55,121 INFO L93 Difference]: Finished difference Result 246 states and 262 transitions. [2020-12-09 20:24:55,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 20:24:55,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-12-09 20:24:55,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:24:55,122 INFO L225 Difference]: With dead ends: 246 [2020-12-09 20:24:55,122 INFO L226 Difference]: Without dead ends: 246 [2020-12-09 20:24:55,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-09 20:24:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-12-09 20:24:55,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 110. [2020-12-09 20:24:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-09 20:24:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-12-09 20:24:55,128 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 8 [2020-12-09 20:24:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:24:55,129 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-12-09 20:24:55,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:24:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-12-09 20:24:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 20:24:55,129 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:24:55,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:24:55,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 20:24:55,330 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:24:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:24:55,330 INFO L82 PathProgramCache]: Analyzing trace with hash 176702730, now seen corresponding path program 1 times [2020-12-09 20:24:55,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:24:55,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087141701] [2020-12-09 20:24:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 [2020-12-09 20:24:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:24:55,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 20:24:55,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:24:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:24:55,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:24:55,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087141701] [2020-12-09 20:24:55,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:24:55,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:24:55,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268878787] [2020-12-09 20:24:55,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 20:24:55,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:24:55,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 20:24:55,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 20:24:55,382 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 4 states. [2020-12-09 20:24:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:24:55,455 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2020-12-09 20:24:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 20:24:55,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 20:24:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:24:55,456 INFO L225 Difference]: With dead ends: 126 [2020-12-09 20:24:55,456 INFO L226 Difference]: Without dead ends: 124 [2020-12-09 20:24:55,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:24:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-12-09 20:24:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 66. [2020-12-09 20:24:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-12-09 20:24:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2020-12-09 20:24:55,459 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 8 [2020-12-09 20:24:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:24:55,459 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2020-12-09 20:24:55,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 20:24:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2020-12-09 20:24:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 20:24:55,459 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:24:55,459 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:24:55,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 20:24:55,660 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:24:55,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:24:55,661 INFO L82 PathProgramCache]: Analyzing trace with hash -270945900, now seen corresponding path program 1 times [2020-12-09 20:24:55,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:24:55,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61606343] [2020-12-09 20:24:55,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 [2020-12-09 20:24:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:24:55,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 20:24:55,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:24:55,740 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:24:55,740 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:24:55,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:24:55,746 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:24:55,746 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-12-09 20:24:55,760 INFO L382 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 16 treesize of output 8 [2020-12-09 20:24:55,760 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:24:55,762 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:24:55,762 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:24:55,762 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-12-09 20:24:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:24:55,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:24:55,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61606343] [2020-12-09 20:24:55,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:24:55,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 20:24:55,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190924574] [2020-12-09 20:24:55,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:24:55,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:24:55,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:24:55,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:24:55,771 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 6 states. [2020-12-09 20:24:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:24:55,922 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2020-12-09 20:24:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 20:24:55,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 20:24:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:24:55,923 INFO L225 Difference]: With dead ends: 130 [2020-12-09 20:24:55,923 INFO L226 Difference]: Without dead ends: 130 [2020-12-09 20:24:55,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-12-09 20:24:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-12-09 20:24:55,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 71. [2020-12-09 20:24:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-09 20:24:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2020-12-09 20:24:55,926 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 13 [2020-12-09 20:24:55,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:24:55,926 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2020-12-09 20:24:55,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:24:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2020-12-09 20:24:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 20:24:55,927 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:24:55,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:24:56,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 20:24:56,129 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:24:56,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:24:56,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1080292526, now seen corresponding path program 1 times [2020-12-09 20:24:56,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:24:56,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647406343] [2020-12-09 20:24:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 [2020-12-09 20:24:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:24:56,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 20:24:56,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:24:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:24:56,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:24:56,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647406343] [2020-12-09 20:24:56,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:24:56,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 20:24:56,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699923461] [2020-12-09 20:24:56,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:24:56,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:24:56,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:24:56,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:24:56,277 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 5 states. [2020-12-09 20:24:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:24:56,402 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2020-12-09 20:24:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 20:24:56,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-09 20:24:56,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:24:56,403 INFO L225 Difference]: With dead ends: 119 [2020-12-09 20:24:56,403 INFO L226 Difference]: Without dead ends: 119 [2020-12-09 20:24:56,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:24:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-12-09 20:24:56,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 70. [2020-12-09 20:24:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-12-09 20:24:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2020-12-09 20:24:56,407 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2020-12-09 20:24:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:24:56,407 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2020-12-09 20:24:56,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:24:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-12-09 20:24:56,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 20:24:56,407 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:24:56,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:24:56,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 20:24:56,609 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:24:56,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:24:56,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1220972534, now seen corresponding path program 1 times [2020-12-09 20:24:56,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:24:56,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433939848] [2020-12-09 20:24:56,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 [2020-12-09 20:24:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:24:56,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 20:24:56,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:24:56,675 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:24:56,675 INFO L382 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 [2020-12-09 20:24:56,677 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:24:56,687 INFO L625 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2020-12-09 20:24:56,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:24:56,690 INFO L547 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. [2020-12-09 20:24:56,690 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 20:24:56,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:24:56,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:24:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:24:58,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:24:58,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433939848] [2020-12-09 20:24:58,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:24:58,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 20:24:58,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026847082] [2020-12-09 20:24:58,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 20:24:58,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:24:58,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 20:24:58,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2020-12-09 20:24:58,806 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 7 states. [2020-12-09 20:25:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:01,390 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2020-12-09 20:25:01,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 20:25:01,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-09 20:25:01,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:01,391 INFO L225 Difference]: With dead ends: 120 [2020-12-09 20:25:01,391 INFO L226 Difference]: Without dead ends: 116 [2020-12-09 20:25:01,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=21, Invalid=34, Unknown=1, NotChecked=0, Total=56 [2020-12-09 20:25:01,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-12-09 20:25:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 62. [2020-12-09 20:25:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-12-09 20:25:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2020-12-09 20:25:01,394 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 15 [2020-12-09 20:25:01,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:01,394 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2020-12-09 20:25:01,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 20:25:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-12-09 20:25:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 20:25:01,394 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:01,394 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:01,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 20:25:01,595 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:01,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:01,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1514178510, now seen corresponding path program 1 times [2020-12-09 20:25:01,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:01,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738065833] [2020-12-09 20:25:01,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 [2020-12-09 20:25:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:01,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 20:25:01,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:01,701 INFO L382 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 [2020-12-09 20:25:01,702 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:01,704 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:01,704 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:01,704 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:25:01,717 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:01,717 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:01,722 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:01,723 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:01,723 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-12-09 20:25:01,735 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-12-09 20:25:01,735 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:01,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:01,737 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:01,738 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:7 [2020-12-09 20:25:01,766 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:01,767 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-12-09 20:25:01,769 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:01,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:01,775 INFO L547 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. [2020-12-09 20:25:01,776 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2020-12-09 20:25:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:01,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:01,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738065833] [2020-12-09 20:25:01,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:01,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 20:25:01,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795808718] [2020-12-09 20:25:01,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 20:25:01,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:01,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 20:25:01,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 20:25:01,796 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 7 states. [2020-12-09 20:25:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:02,129 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2020-12-09 20:25:02,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 20:25:02,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-09 20:25:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:02,130 INFO L225 Difference]: With dead ends: 116 [2020-12-09 20:25:02,130 INFO L226 Difference]: Without dead ends: 116 [2020-12-09 20:25:02,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-12-09 20:25:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-12-09 20:25:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 72. [2020-12-09 20:25:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-12-09 20:25:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2020-12-09 20:25:02,132 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 16 [2020-12-09 20:25:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:02,133 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2020-12-09 20:25:02,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 20:25:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2020-12-09 20:25:02,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 20:25:02,133 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:02,133 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:02,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-09 20:25:02,336 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:02,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:02,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1514178509, now seen corresponding path program 1 times [2020-12-09 20:25:02,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:02,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465462479] [2020-12-09 20:25:02,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 [2020-12-09 20:25:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:02,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 20:25:02,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:02,522 INFO L382 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 [2020-12-09 20:25:02,522 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:02,528 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:02,531 INFO L382 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 [2020-12-09 20:25:02,531 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:02,536 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:02,536 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:02,537 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:16 [2020-12-09 20:25:02,565 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:02,566 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:02,576 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:02,579 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:02,580 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:02,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:02,589 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:02,590 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2020-12-09 20:25:02,620 INFO L382 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 [2020-12-09 20:25:02,622 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:02,632 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:02,635 INFO L382 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 30 treesize of output 18 [2020-12-09 20:25:02,636 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:02,643 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:02,644 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:02,644 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:16 [2020-12-09 20:25:02,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 20:25:02,676 INFO L382 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 14 treesize of output 16 [2020-12-09 20:25:02,678 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:02,691 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:02,703 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:02,704 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 20:25:02,705 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:02,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:02,716 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:02,716 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:9 [2020-12-09 20:25:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:02,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:02,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465462479] [2020-12-09 20:25:02,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:02,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 20:25:02,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353360850] [2020-12-09 20:25:02,731 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 20:25:02,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:02,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 20:25:02,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-09 20:25:02,732 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 8 states. [2020-12-09 20:25:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:03,278 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2020-12-09 20:25:03,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 20:25:03,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-12-09 20:25:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:03,279 INFO L225 Difference]: With dead ends: 115 [2020-12-09 20:25:03,279 INFO L226 Difference]: Without dead ends: 115 [2020-12-09 20:25:03,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2020-12-09 20:25:03,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-12-09 20:25:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2020-12-09 20:25:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-12-09 20:25:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2020-12-09 20:25:03,281 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 16 [2020-12-09 20:25:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:03,281 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2020-12-09 20:25:03,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 20:25:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-12-09 20:25:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 20:25:03,282 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:03,282 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:03,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-09 20:25:03,484 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash -813113932, now seen corresponding path program 1 times [2020-12-09 20:25:03,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:03,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171067299] [2020-12-09 20:25:03,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 [2020-12-09 20:25:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:03,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 20:25:03,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:03,655 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:03,656 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:03,662 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:03,665 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:03,665 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:03,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:03,670 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:03,670 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-12-09 20:25:03,688 INFO L382 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 [2020-12-09 20:25:03,688 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:03,695 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:03,696 INFO L382 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 [2020-12-09 20:25:03,697 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:03,700 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:03,701 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:03,701 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2020-12-09 20:25:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:03,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:03,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171067299] [2020-12-09 20:25:03,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:03,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 20:25:03,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90091714] [2020-12-09 20:25:03,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:25:03,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:03,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:25:03,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:25:03,713 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 6 states. [2020-12-09 20:25:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:03,883 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2020-12-09 20:25:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 20:25:03,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-09 20:25:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:03,884 INFO L225 Difference]: With dead ends: 110 [2020-12-09 20:25:03,884 INFO L226 Difference]: Without dead ends: 105 [2020-12-09 20:25:03,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-12-09 20:25:03,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-12-09 20:25:03,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 60. [2020-12-09 20:25:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-09 20:25:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-12-09 20:25:03,886 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 16 [2020-12-09 20:25:03,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:03,886 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-12-09 20:25:03,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:25:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-12-09 20:25:03,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 20:25:03,886 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:03,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:04,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-12-09 20:25:04,088 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:04,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1149536387, now seen corresponding path program 1 times [2020-12-09 20:25:04,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:04,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914214753] [2020-12-09 20:25:04,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:04,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 20:25:04,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:04,209 INFO L382 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 [2020-12-09 20:25:04,209 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:04,211 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:04,211 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:04,211 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:25:04,226 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:04,226 INFO L382 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 [2020-12-09 20:25:04,227 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:04,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:04,229 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:04,229 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-12-09 20:25:04,251 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:04,252 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:04,256 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:04,257 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:04,257 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-12-09 20:25:04,306 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:04,306 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 53 [2020-12-09 20:25:04,309 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 20:25:04,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:25:04,310 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:04,318 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:04,319 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:04,319 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:18 [2020-12-09 20:25:04,338 INFO L382 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 27 treesize of output 15 [2020-12-09 20:25:04,339 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:04,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:04,344 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:04,344 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2020-12-09 20:25:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:04,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:04,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914214753] [2020-12-09 20:25:04,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:04,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 20:25:04,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67704112] [2020-12-09 20:25:04,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 20:25:04,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:04,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 20:25:04,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-09 20:25:04,355 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2020-12-09 20:25:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:04,897 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2020-12-09 20:25:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 20:25:04,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-12-09 20:25:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:04,898 INFO L225 Difference]: With dead ends: 127 [2020-12-09 20:25:04,898 INFO L226 Difference]: Without dead ends: 127 [2020-12-09 20:25:04,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2020-12-09 20:25:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-12-09 20:25:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 59. [2020-12-09 20:25:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-12-09 20:25:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-12-09 20:25:04,900 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 19 [2020-12-09 20:25:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:04,900 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-12-09 20:25:04,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 20:25:04,900 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-12-09 20:25:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 20:25:04,901 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:04,901 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:05,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-12-09 20:25:05,103 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:05,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:05,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1149536388, now seen corresponding path program 1 times [2020-12-09 20:25:05,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:05,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559667914] [2020-12-09 20:25:05,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:05,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-09 20:25:05,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:05,192 INFO L382 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 [2020-12-09 20:25:05,192 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,194 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,194 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:25:05,212 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_39|], 3=[|v_#valid_62|]} [2020-12-09 20:25:05,215 INFO L382 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 [2020-12-09 20:25:05,216 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,225 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,238 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,238 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-12-09 20:25:05,240 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,248 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,248 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,248 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2020-12-09 20:25:05,289 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:05,289 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,306 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,310 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:05,310 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,324 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,325 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,325 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2020-12-09 20:25:05,401 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_40|], 3=[|v_#valid_63|]} [2020-12-09 20:25:05,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 20:25:05,406 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-12-09 20:25:05,407 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,426 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,443 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,444 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2020-12-09 20:25:05,445 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,462 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,464 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,464 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:34 [2020-12-09 20:25:05,522 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,522 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 64 [2020-12-09 20:25:05,524 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 20:25:05,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:25:05,525 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,541 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,545 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2020-12-09 20:25:05,546 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,561 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,562 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,562 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:27 [2020-12-09 20:25:05,592 INFO L382 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 [2020-12-09 20:25:05,593 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,604 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,605 INFO L382 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 27 treesize of output 15 [2020-12-09 20:25:05,606 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,612 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:05,613 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:05,614 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:9 [2020-12-09 20:25:05,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:05,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:05,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559667914] [2020-12-09 20:25:05,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:05,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 20:25:05,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039778909] [2020-12-09 20:25:05,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 20:25:05,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:05,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 20:25:05,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-09 20:25:05,630 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 12 states. [2020-12-09 20:25:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:06,498 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2020-12-09 20:25:06,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 20:25:06,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-12-09 20:25:06,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:06,499 INFO L225 Difference]: With dead ends: 105 [2020-12-09 20:25:06,499 INFO L226 Difference]: Without dead ends: 105 [2020-12-09 20:25:06,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2020-12-09 20:25:06,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-12-09 20:25:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 58. [2020-12-09 20:25:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-09 20:25:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-12-09 20:25:06,501 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 19 [2020-12-09 20:25:06,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:06,501 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-12-09 20:25:06,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 20:25:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-12-09 20:25:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 20:25:06,502 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:06,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:06,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-12-09 20:25:06,703 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:06,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:06,704 INFO L82 PathProgramCache]: Analyzing trace with hash 897873764, now seen corresponding path program 1 times [2020-12-09 20:25:06,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:06,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349105179] [2020-12-09 20:25:06,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/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 [2020-12-09 20:25:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:06,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 20:25:06,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:06,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:06,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349105179] [2020-12-09 20:25:06,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:06,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 20:25:06,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592773381] [2020-12-09 20:25:06,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 20:25:06,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 20:25:06,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 20:25:06,841 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 4 states. [2020-12-09 20:25:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:06,936 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2020-12-09 20:25:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 20:25:06,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-12-09 20:25:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:06,937 INFO L225 Difference]: With dead ends: 57 [2020-12-09 20:25:06,937 INFO L226 Difference]: Without dead ends: 57 [2020-12-09 20:25:06,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:25:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-12-09 20:25:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-12-09 20:25:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-12-09 20:25:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2020-12-09 20:25:06,938 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 21 [2020-12-09 20:25:06,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:06,939 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2020-12-09 20:25:06,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 20:25:06,939 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-12-09 20:25:06,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 20:25:06,939 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:06,939 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:07,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-12-09 20:25:07,140 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:07,142 INFO L82 PathProgramCache]: Analyzing trace with hash 897873765, now seen corresponding path program 1 times [2020-12-09 20:25:07,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:07,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683746723] [2020-12-09 20:25:07,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:07,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 20:25:07,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:07,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:07,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683746723] [2020-12-09 20:25:07,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:07,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 20:25:07,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616472842] [2020-12-09 20:25:07,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:25:07,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:07,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:25:07,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:25:07,323 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2020-12-09 20:25:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:07,509 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-12-09 20:25:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 20:25:07,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-09 20:25:07,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:07,510 INFO L225 Difference]: With dead ends: 89 [2020-12-09 20:25:07,510 INFO L226 Difference]: Without dead ends: 89 [2020-12-09 20:25:07,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-09 20:25:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-12-09 20:25:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2020-12-09 20:25:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 20:25:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2020-12-09 20:25:07,511 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 21 [2020-12-09 20:25:07,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:07,511 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2020-12-09 20:25:07,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:25:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-12-09 20:25:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 20:25:07,512 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:07,512 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:07,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-12-09 20:25:07,713 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:07,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:07,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2064282042, now seen corresponding path program 1 times [2020-12-09 20:25:07,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:07,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15911566] [2020-12-09 20:25:07,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:07,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 20:25:07,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:07,831 INFO L382 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 [2020-12-09 20:25:07,832 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:07,833 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:07,833 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:07,833 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:25:07,848 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:07,848 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 20:25:07,849 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:07,851 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:07,851 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:07,851 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2020-12-09 20:25:07,867 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:07,868 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:07,876 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:07,879 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:07,879 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:07,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:07,887 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:07,887 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:8 [2020-12-09 20:25:07,989 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:07,990 INFO L382 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 73 [2020-12-09 20:25:07,991 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 20:25:07,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:25:07,992 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:08,005 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:08,011 INFO L382 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2020-12-09 20:25:08,012 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:08,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:08,023 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:08,023 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:25 [2020-12-09 20:25:08,050 INFO L382 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 24 treesize of output 16 [2020-12-09 20:25:08,050 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:08,058 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:08,059 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 20:25:08,059 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2020-12-09 20:25:08,097 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:08,097 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2020-12-09 20:25:08,099 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 20:25:08,100 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:08,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:08,101 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:08,101 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:4 [2020-12-09 20:25:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:08,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:08,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15911566] [2020-12-09 20:25:08,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:08,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-09 20:25:08,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240784669] [2020-12-09 20:25:08,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 20:25:08,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:08,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 20:25:08,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-12-09 20:25:08,118 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 13 states. [2020-12-09 20:25:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:13,042 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2020-12-09 20:25:13,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 20:25:13,042 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-12-09 20:25:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:13,043 INFO L225 Difference]: With dead ends: 117 [2020-12-09 20:25:13,043 INFO L226 Difference]: Without dead ends: 117 [2020-12-09 20:25:13,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2020-12-09 20:25:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-12-09 20:25:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 62. [2020-12-09 20:25:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-12-09 20:25:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2020-12-09 20:25:13,045 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 22 [2020-12-09 20:25:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:13,045 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2020-12-09 20:25:13,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 20:25:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2020-12-09 20:25:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 20:25:13,045 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:13,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:13,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-12-09 20:25:13,247 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2064282941, now seen corresponding path program 1 times [2020-12-09 20:25:13,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:13,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924357183] [2020-12-09 20:25:13,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:13,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 20:25:13,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:13,346 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-12-09 20:25:13,346 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:13,348 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:13,348 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:13,348 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:7 [2020-12-09 20:25:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:13,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:13,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924357183] [2020-12-09 20:25:13,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:13,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 20:25:13,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609477256] [2020-12-09 20:25:13,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:25:13,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:13,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:25:13,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:25:13,359 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 6 states. [2020-12-09 20:25:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:13,549 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2020-12-09 20:25:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 20:25:13,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-12-09 20:25:13,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:13,550 INFO L225 Difference]: With dead ends: 67 [2020-12-09 20:25:13,550 INFO L226 Difference]: Without dead ends: 67 [2020-12-09 20:25:13,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-09 20:25:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-09 20:25:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2020-12-09 20:25:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 20:25:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-12-09 20:25:13,551 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 22 [2020-12-09 20:25:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:13,551 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-12-09 20:25:13,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:25:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-12-09 20:25:13,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 20:25:13,552 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:13,552 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:13,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-12-09 20:25:13,753 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:13,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2064282942, now seen corresponding path program 1 times [2020-12-09 20:25:13,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:13,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969623137] [2020-12-09 20:25:13,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:13,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 20:25:13,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:13,913 INFO L382 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 36 treesize of output 20 [2020-12-09 20:25:13,914 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:13,935 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:13,939 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-12-09 20:25:13,941 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:13,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:13,955 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:13,955 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:13 [2020-12-09 20:25:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:13,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:13,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969623137] [2020-12-09 20:25:13,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:13,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 20:25:13,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263314245] [2020-12-09 20:25:13,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 20:25:13,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:13,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 20:25:13,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 20:25:13,991 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 6 states. [2020-12-09 20:25:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:14,644 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2020-12-09 20:25:14,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 20:25:14,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-12-09 20:25:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:14,645 INFO L225 Difference]: With dead ends: 77 [2020-12-09 20:25:14,645 INFO L226 Difference]: Without dead ends: 77 [2020-12-09 20:25:14,646 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-09 20:25:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-12-09 20:25:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2020-12-09 20:25:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-09 20:25:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-12-09 20:25:14,647 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 22 [2020-12-09 20:25:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:14,647 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-12-09 20:25:14,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 20:25:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-12-09 20:25:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 20:25:14,647 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:14,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:14,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-12-09 20:25:14,849 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:14,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:14,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1550626884, now seen corresponding path program 1 times [2020-12-09 20:25:14,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:14,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105228198] [2020-12-09 20:25:14,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:15,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 20:25:15,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:15,084 INFO L382 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 [2020-12-09 20:25:15,084 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:15,086 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:15,086 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:15,086 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:25:15,104 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:15,104 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 20:25:15,104 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:15,110 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:15,110 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:15,110 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2020-12-09 20:25:15,139 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:15,139 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:15,151 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:15,154 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:15,154 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:15,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:15,164 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:15,164 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-12-09 20:25:15,186 INFO L382 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 16 treesize of output 8 [2020-12-09 20:25:15,186 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:15,191 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:15,192 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:15,192 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2020-12-09 20:25:15,217 INFO L382 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 19 treesize of output 18 [2020-12-09 20:25:15,218 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:15,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:15,228 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:15,228 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2020-12-09 20:25:15,244 INFO L382 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 [2020-12-09 20:25:15,244 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:15,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:15,246 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:15,246 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-12-09 20:25:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:15,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:15,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105228198] [2020-12-09 20:25:15,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:15,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 20:25:15,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929272942] [2020-12-09 20:25:15,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 20:25:15,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:15,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 20:25:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-09 20:25:15,258 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2020-12-09 20:25:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:15,744 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2020-12-09 20:25:15,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-09 20:25:15,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-09 20:25:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:15,745 INFO L225 Difference]: With dead ends: 103 [2020-12-09 20:25:15,745 INFO L226 Difference]: Without dead ends: 103 [2020-12-09 20:25:15,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2020-12-09 20:25:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-12-09 20:25:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2020-12-09 20:25:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 20:25:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-12-09 20:25:15,747 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 22 [2020-12-09 20:25:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:15,747 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-12-09 20:25:15,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 20:25:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-12-09 20:25:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 20:25:15,747 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:15,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:15,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-12-09 20:25:15,949 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:15,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:15,950 INFO L82 PathProgramCache]: Analyzing trace with hash -824793020, now seen corresponding path program 1 times [2020-12-09 20:25:15,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:15,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911505249] [2020-12-09 20:25:15,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:16,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 20:25:16,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:16,043 INFO L382 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 [2020-12-09 20:25:16,043 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:16,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:16,045 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:16,045 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:25:16,061 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:16,061 INFO L382 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 [2020-12-09 20:25:16,062 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:16,067 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:16,068 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:16,068 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-12-09 20:25:16,095 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:16,096 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:16,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:16,104 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:16,104 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2020-12-09 20:25:16,167 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:16,167 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 49 [2020-12-09 20:25:16,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 20:25:16,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:25:16,169 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:16,178 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:16,179 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:16,179 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:16 [2020-12-09 20:25:16,185 INFO L382 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 [2020-12-09 20:25:16,186 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:16,191 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:16,192 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:16,192 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2020-12-09 20:25:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:16,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:16,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911505249] [2020-12-09 20:25:16,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:16,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 20:25:16,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931994109] [2020-12-09 20:25:16,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 20:25:16,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:16,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 20:25:16,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-09 20:25:16,208 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 9 states. [2020-12-09 20:25:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:16,824 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2020-12-09 20:25:16,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-09 20:25:16,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-12-09 20:25:16,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:16,825 INFO L225 Difference]: With dead ends: 102 [2020-12-09 20:25:16,825 INFO L226 Difference]: Without dead ends: 102 [2020-12-09 20:25:16,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2020-12-09 20:25:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-12-09 20:25:16,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 62. [2020-12-09 20:25:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-12-09 20:25:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2020-12-09 20:25:16,827 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 23 [2020-12-09 20:25:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:16,827 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2020-12-09 20:25:16,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 20:25:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2020-12-09 20:25:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 20:25:16,828 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:16,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:17,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-12-09 20:25:17,029 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:17,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:17,030 INFO L82 PathProgramCache]: Analyzing trace with hash 201220286, now seen corresponding path program 1 times [2020-12-09 20:25:17,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:17,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992433441] [2020-12-09 20:25:17,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:17,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 20:25:17,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:17,205 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-12-09 20:25:17,206 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:17,208 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,208 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-12-09 20:25:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:17,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:17,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992433441] [2020-12-09 20:25:17,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:17,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 20:25:17,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983277182] [2020-12-09 20:25:17,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:25:17,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:17,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:25:17,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:25:17,216 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 5 states. [2020-12-09 20:25:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:17,355 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2020-12-09 20:25:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 20:25:17,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-12-09 20:25:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:17,356 INFO L225 Difference]: With dead ends: 63 [2020-12-09 20:25:17,356 INFO L226 Difference]: Without dead ends: 63 [2020-12-09 20:25:17,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 20:25:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-09 20:25:17,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-12-09 20:25:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 20:25:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2020-12-09 20:25:17,357 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 24 [2020-12-09 20:25:17,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:17,357 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2020-12-09 20:25:17,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:25:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2020-12-09 20:25:17,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 20:25:17,358 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:17,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:17,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-12-09 20:25:17,559 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:17,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:17,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1513391073, now seen corresponding path program 1 times [2020-12-09 20:25:17,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:17,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576530945] [2020-12-09 20:25:17,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:17,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 20:25:17,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:17,705 INFO L382 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 [2020-12-09 20:25:17,706 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:17,707 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,707 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:25:17,722 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:17,722 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 20:25:17,723 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,724 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:17,725 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,725 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2020-12-09 20:25:17,740 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:17,740 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:17,745 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,745 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-12-09 20:25:17,786 INFO L382 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 [2020-12-09 20:25:17,786 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,796 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:17,797 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,797 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:30 [2020-12-09 20:25:17,854 INFO L382 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2020-12-09 20:25:17,855 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,868 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:17,890 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:17,890 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 69 [2020-12-09 20:25:17,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 20:25:17,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:25:17,893 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:17,907 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,907 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:28 [2020-12-09 20:25:17,963 INFO L382 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 27 treesize of output 19 [2020-12-09 20:25:17,964 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:17,975 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:17,976 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 20:25:17,976 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2020-12-09 20:25:18,025 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:18,025 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2020-12-09 20:25:18,026 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 20:25:18,027 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:18,029 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:18,029 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:18,029 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2020-12-09 20:25:18,063 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:18,063 INFO L382 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 [2020-12-09 20:25:18,064 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:18,077 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-12-09 20:25:18,078 INFO L547 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. [2020-12-09 20:25:18,078 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2020-12-09 20:25:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:18,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:18,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576530945] [2020-12-09 20:25:18,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:18,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-09 20:25:18,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506923709] [2020-12-09 20:25:18,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 20:25:18,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:18,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 20:25:18,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-12-09 20:25:18,105 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 14 states. [2020-12-09 20:25:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:21,203 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2020-12-09 20:25:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 20:25:21,204 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2020-12-09 20:25:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:21,204 INFO L225 Difference]: With dead ends: 108 [2020-12-09 20:25:21,204 INFO L226 Difference]: Without dead ends: 108 [2020-12-09 20:25:21,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2020-12-09 20:25:21,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-12-09 20:25:21,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 69. [2020-12-09 20:25:21,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-12-09 20:25:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2020-12-09 20:25:21,206 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 26 [2020-12-09 20:25:21,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:21,206 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2020-12-09 20:25:21,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 20:25:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-12-09 20:25:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 20:25:21,207 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:21,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:21,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2020-12-09 20:25:21,408 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1513391074, now seen corresponding path program 1 times [2020-12-09 20:25:21,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:21,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403985156] [2020-12-09 20:25:21,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:21,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 38 conjunts are in the unsatisfiable core [2020-12-09 20:25:21,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:21,562 INFO L382 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 [2020-12-09 20:25:21,562 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:21,565 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:21,565 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:21,565 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:25:21,583 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_41|], 3=[|v_#valid_75|]} [2020-12-09 20:25:21,585 INFO L382 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 [2020-12-09 20:25:21,586 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:21,592 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:21,607 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:21,607 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-12-09 20:25:21,608 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:21,615 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:21,615 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:21,615 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2020-12-09 20:25:21,645 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:21,646 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:21,655 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:21,656 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:21,656 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:32 [2020-12-09 20:25:21,744 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_42|], 3=[|v_#valid_76|]} [2020-12-09 20:25:21,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 20:25:21,749 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-12-09 20:25:21,750 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:21,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:21,791 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:21,791 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-12-09 20:25:21,792 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:21,814 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:21,814 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:21,815 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2020-12-09 20:25:21,919 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2020-12-09 20:25:21,920 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:21,945 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:21,969 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:21,969 INFO L382 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 78 [2020-12-09 20:25:21,971 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-09 20:25:21,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:25:21,972 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:21,992 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:21,992 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:21,993 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:88 [2020-12-09 20:25:22,150 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 64 [2020-12-09 20:25:22,152 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 20:25:22,172 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:22,180 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:22,180 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 43 [2020-12-09 20:25:22,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:25:22,183 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 20:25:22,197 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:22,199 INFO L547 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. [2020-12-09 20:25:22,199 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:120, output treesize:22 [2020-12-09 20:25:22,344 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:22,344 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 52 [2020-12-09 20:25:22,346 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:22,377 INFO L625 ElimStorePlain]: treesize reduction 28, result has 49.1 percent of original size [2020-12-09 20:25:22,378 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 20:25:22,378 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:25 [2020-12-09 20:25:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:22,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:22,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403985156] [2020-12-09 20:25:22,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:22,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-09 20:25:22,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700408828] [2020-12-09 20:25:22,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 20:25:22,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:22,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 20:25:22,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-12-09 20:25:22,423 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 17 states. [2020-12-09 20:25:23,572 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-12-09 20:25:23,882 WARN L197 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2020-12-09 20:25:24,288 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2020-12-09 20:25:24,611 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2020-12-09 20:25:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:25,125 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2020-12-09 20:25:25,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-09 20:25:25,126 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2020-12-09 20:25:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:25,126 INFO L225 Difference]: With dead ends: 88 [2020-12-09 20:25:25,126 INFO L226 Difference]: Without dead ends: 88 [2020-12-09 20:25:25,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 20:25:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-12-09 20:25:25,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2020-12-09 20:25:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-12-09 20:25:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-12-09 20:25:25,128 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 26 [2020-12-09 20:25:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:25,128 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-12-09 20:25:25,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 20:25:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-12-09 20:25:25,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 20:25:25,128 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:25,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:25,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2020-12-09 20:25:25,329 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:25,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:25,329 INFO L82 PathProgramCache]: Analyzing trace with hash 926585059, now seen corresponding path program 1 times [2020-12-09 20:25:25,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:25,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546990541] [2020-12-09 20:25:25,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:25,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 20:25:25,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:25,423 INFO L382 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 [2020-12-09 20:25:25,423 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:25,425 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:25,425 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:25,425 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:25:25,439 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:25,440 INFO L382 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 [2020-12-09 20:25:25,440 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:25,442 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:25,442 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:25,442 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-12-09 20:25:25,458 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:25,458 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:25,464 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:25,464 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:25,464 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-12-09 20:25:25,557 INFO L382 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2020-12-09 20:25:25,558 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:25,568 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:25,590 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:25,590 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 69 [2020-12-09 20:25:25,591 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 20:25:25,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:25:25,592 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:25,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:25,601 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:25,601 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:39 [2020-12-09 20:25:25,662 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2020-12-09 20:25:25,664 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 20:25:25,674 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:25,683 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:25,683 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2020-12-09 20:25:25,684 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 20:25:25,685 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:25,689 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:25,689 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:25,689 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2020-12-09 20:25:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:25,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:25,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546990541] [2020-12-09 20:25:25,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:25,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-09 20:25:25,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135207380] [2020-12-09 20:25:25,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 20:25:25,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:25,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 20:25:25,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-12-09 20:25:25,712 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 13 states. [2020-12-09 20:25:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:28,795 INFO L93 Difference]: Finished difference Result 94 states and 93 transitions. [2020-12-09 20:25:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 20:25:28,796 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-12-09 20:25:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:28,796 INFO L225 Difference]: With dead ends: 94 [2020-12-09 20:25:28,796 INFO L226 Difference]: Without dead ends: 94 [2020-12-09 20:25:28,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2020-12-09 20:25:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-12-09 20:25:28,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2020-12-09 20:25:28,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-09 20:25:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2020-12-09 20:25:28,798 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 26 [2020-12-09 20:25:28,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:28,798 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2020-12-09 20:25:28,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 20:25:28,798 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2020-12-09 20:25:28,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 20:25:28,798 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:28,798 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:28,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2020-12-09 20:25:28,999 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:29,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:29,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1220672855, now seen corresponding path program 1 times [2020-12-09 20:25:29,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:29,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162075384] [2020-12-09 20:25:29,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:29,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 20:25:29,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:29,119 INFO L382 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 [2020-12-09 20:25:29,119 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:29,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:29,121 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:29,121 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:25:29,134 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:29,134 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 20:25:29,135 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:29,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:29,137 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:29,137 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2020-12-09 20:25:29,150 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:29,151 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:29,155 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:29,155 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:29,156 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-12-09 20:25:29,204 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:29,204 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 46 [2020-12-09 20:25:29,205 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-12-09 20:25:29,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:25:29,206 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:29,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:29,214 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:29,214 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:14 [2020-12-09 20:25:29,231 INFO L382 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 16 treesize of output 8 [2020-12-09 20:25:29,232 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:29,236 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:29,236 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:29,236 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2020-12-09 20:25:29,253 INFO L382 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 [2020-12-09 20:25:29,253 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:29,263 INFO L625 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2020-12-09 20:25:29,264 INFO L547 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. [2020-12-09 20:25:29,264 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:13 [2020-12-09 20:25:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:29,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:29,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162075384] [2020-12-09 20:25:29,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:29,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-09 20:25:29,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605711126] [2020-12-09 20:25:29,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 20:25:29,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:29,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 20:25:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-12-09 20:25:29,290 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 11 states. [2020-12-09 20:25:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:45,811 INFO L93 Difference]: Finished difference Result 93 states and 92 transitions. [2020-12-09 20:25:45,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 20:25:45,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-12-09 20:25:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:45,812 INFO L225 Difference]: With dead ends: 93 [2020-12-09 20:25:45,812 INFO L226 Difference]: Without dead ends: 93 [2020-12-09 20:25:45,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2020-12-09 20:25:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-12-09 20:25:45,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 64. [2020-12-09 20:25:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 20:25:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-12-09 20:25:45,814 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 27 [2020-12-09 20:25:45,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:45,814 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-12-09 20:25:45,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 20:25:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-12-09 20:25:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 20:25:45,814 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:45,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:46,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2020-12-09 20:25:46,015 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:46,016 INFO L82 PathProgramCache]: Analyzing trace with hash 813847300, now seen corresponding path program 1 times [2020-12-09 20:25:46,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:46,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199068760] [2020-12-09 20:25:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:46,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 20:25:46,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:46,158 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:46,159 INFO L382 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 [2020-12-09 20:25:46,159 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:46,170 INFO L625 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2020-12-09 20:25:46,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:25:46,171 INFO L547 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. [2020-12-09 20:25:46,171 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 20:25:46,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:25:46,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 20:25:46,276 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:46,277 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:46,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:46,289 INFO L547 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. [2020-12-09 20:25:46,289 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:36 [2020-12-09 20:25:46,396 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:46,397 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 59 [2020-12-09 20:25:46,398 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 20:25:46,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:25:46,399 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:46,430 INFO L625 ElimStorePlain]: treesize reduction 20, result has 70.1 percent of original size [2020-12-09 20:25:46,432 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 20:25:46,432 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:38 [2020-12-09 20:25:46,470 INFO L382 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 33 treesize of output 21 [2020-12-09 20:25:46,472 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:46,483 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:46,484 INFO L547 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. [2020-12-09 20:25:46,484 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2020-12-09 20:25:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:48,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:48,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199068760] [2020-12-09 20:25:48,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:48,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 20:25:48,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211525139] [2020-12-09 20:25:48,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 20:25:48,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:48,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 20:25:48,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=119, Unknown=1, NotChecked=0, Total=156 [2020-12-09 20:25:48,655 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-12-09 20:25:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:55,786 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2020-12-09 20:25:55,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-09 20:25:55,787 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2020-12-09 20:25:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:55,787 INFO L225 Difference]: With dead ends: 65 [2020-12-09 20:25:55,787 INFO L226 Difference]: Without dead ends: 51 [2020-12-09 20:25:55,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=71, Invalid=269, Unknown=2, NotChecked=0, Total=342 [2020-12-09 20:25:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-09 20:25:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-12-09 20:25:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-09 20:25:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2020-12-09 20:25:55,788 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 28 [2020-12-09 20:25:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:55,789 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2020-12-09 20:25:55,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 20:25:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-12-09 20:25:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 20:25:55,789 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:55,789 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:55,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2020-12-09 20:25:55,990 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:55,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1161796369, now seen corresponding path program 1 times [2020-12-09 20:25:55,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:55,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64616304] [2020-12-09 20:25:55,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:56,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-09 20:25:56,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:56,170 INFO L382 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 [2020-12-09 20:25:56,170 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,172 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:56,172 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,172 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:25:56,185 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:56,185 INFO L382 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 [2020-12-09 20:25:56,186 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:56,188 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,188 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-12-09 20:25:56,204 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:56,205 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:56,211 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,211 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-12-09 20:25:56,262 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:56,263 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-09 20:25:56,264 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:56,279 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,279 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:39 [2020-12-09 20:25:56,347 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2020-12-09 20:25:56,347 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,370 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:56,394 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:56,394 INFO L382 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 76 [2020-12-09 20:25:56,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 20:25:56,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:25:56,396 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,414 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:56,415 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,416 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:60 [2020-12-09 20:25:56,501 INFO L382 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 43 treesize of output 31 [2020-12-09 20:25:56,502 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,515 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:56,516 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,516 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:59 [2020-12-09 20:25:56,696 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:56,697 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 142 [2020-12-09 20:25:56,698 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:56,757 INFO L625 ElimStorePlain]: treesize reduction 78, result has 45.8 percent of original size [2020-12-09 20:25:56,758 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 20:25:56,758 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:64 [2020-12-09 20:25:56,901 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:56,901 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 110 [2020-12-09 20:25:56,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-09 20:25:56,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:25:56,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:25:56,905 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-09 20:25:56,906 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-09 20:25:56,906 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-09 20:25:56,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:25:56,907 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-09 20:25:56,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:25:56,909 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-09 20:25:56,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:25:56,911 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-09 20:25:56,912 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-09 20:25:56,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:25:56,914 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-09 20:25:56,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:25:56,915 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-09 20:25:56,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:25:56,924 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 13 xjuncts. [2020-12-09 20:25:57,262 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-12-09 20:25:57,263 INFO L625 ElimStorePlain]: treesize reduction 1834, result has 5.3 percent of original size [2020-12-09 20:25:57,264 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 20:25:57,264 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:70 [2020-12-09 20:25:57,326 INFO L382 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 25 treesize of output 13 [2020-12-09 20:25:57,326 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:57,333 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:57,333 INFO L547 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. [2020-12-09 20:25:57,334 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-12-09 20:25:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:25:57,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:25:57,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64616304] [2020-12-09 20:25:57,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:25:57,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-09 20:25:57,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334999672] [2020-12-09 20:25:57,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 20:25:57,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:25:57,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 20:25:57,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=185, Unknown=1, NotChecked=0, Total=240 [2020-12-09 20:25:57,368 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 16 states. [2020-12-09 20:25:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:25:58,452 INFO L93 Difference]: Finished difference Result 76 states and 75 transitions. [2020-12-09 20:25:58,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 20:25:58,452 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2020-12-09 20:25:58,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:25:58,452 INFO L225 Difference]: With dead ends: 76 [2020-12-09 20:25:58,453 INFO L226 Difference]: Without dead ends: 76 [2020-12-09 20:25:58,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=279, Invalid=838, Unknown=5, NotChecked=0, Total=1122 [2020-12-09 20:25:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-12-09 20:25:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 50. [2020-12-09 20:25:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-12-09 20:25:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2020-12-09 20:25:58,454 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 29 [2020-12-09 20:25:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:25:58,454 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2020-12-09 20:25:58,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 20:25:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2020-12-09 20:25:58,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 20:25:58,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:25:58,454 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:25:58,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2020-12-09 20:25:58,656 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:25:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:25:58,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1161796370, now seen corresponding path program 1 times [2020-12-09 20:25:58,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:25:58,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303014133] [2020-12-09 20:25:58,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2020-12-09 20:25:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:25:58,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-09 20:25:58,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:25:58,952 INFO L382 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 [2020-12-09 20:25:58,953 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:58,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:58,954 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:58,954 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:25:58,970 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_44|], 3=[|v_#valid_92|]} [2020-12-09 20:25:58,973 INFO L382 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 [2020-12-09 20:25:58,974 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:58,982 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:58,996 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:58,996 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-12-09 20:25:58,997 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,005 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:59,006 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,006 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2020-12-09 20:25:59,047 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:59,048 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,065 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:59,068 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:25:59,069 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,081 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:59,084 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,084 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2020-12-09 20:25:59,150 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_45|], 3=[|v_#valid_93|]} [2020-12-09 20:25:59,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 20:25:59,157 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-12-09 20:25:59,157 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,184 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:59,203 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:59,203 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-12-09 20:25:59,204 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:59,225 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,225 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:53 [2020-12-09 20:25:59,311 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2020-12-09 20:25:59,311 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,335 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:59,359 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:59,359 INFO L382 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 80 [2020-12-09 20:25:59,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-09 20:25:59,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:25:59,361 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:59,382 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,382 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:63 [2020-12-09 20:25:59,633 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:59,633 INFO L382 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 1 case distinctions, treesize of input 18 treesize of output 46 [2020-12-09 20:25:59,634 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,683 INFO L625 ElimStorePlain]: treesize reduction 28, result has 75.2 percent of original size [2020-12-09 20:25:59,684 INFO L547 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. [2020-12-09 20:25:59,684 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:85 [2020-12-09 20:25:59,732 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_31|], 6=[|v_#memory_$Pointer$.base_45|]} [2020-12-09 20:25:59,754 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:59,754 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 108 [2020-12-09 20:25:59,755 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,782 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:59,843 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:25:59,843 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 112 [2020-12-09 20:25:59,846 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-09 20:25:59,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:25:59,846 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-09 20:25:59,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 20:25:59,847 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-09 20:25:59,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:25:59,848 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-09 20:25:59,849 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:25:59,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 20:25:59,850 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-09 20:25:59,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:25:59,851 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-09 20:25:59,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:25:59,854 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 6 xjuncts. [2020-12-09 20:25:59,945 INFO L625 ElimStorePlain]: treesize reduction 447, result has 16.0 percent of original size [2020-12-09 20:25:59,946 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,946 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:131, output treesize:55 [2020-12-09 20:25:59,973 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-12-09 20:25:59,976 INFO L382 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 51 treesize of output 35 [2020-12-09 20:25:59,977 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:25:59,992 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:00,003 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:00,003 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 38 [2020-12-09 20:26:00,004 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:00,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:00,012 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:00,012 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:11 [2020-12-09 20:26:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:26:00,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:26:00,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303014133] [2020-12-09 20:26:00,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:26:00,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-09 20:26:00,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672941530] [2020-12-09 20:26:00,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 20:26:00,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:26:00,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 20:26:00,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-12-09 20:26:00,045 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 17 states. [2020-12-09 20:26:01,281 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-12-09 20:26:01,424 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-09 20:26:01,846 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-09 20:26:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:02,114 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2020-12-09 20:26:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 20:26:02,115 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2020-12-09 20:26:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:02,115 INFO L225 Difference]: With dead ends: 60 [2020-12-09 20:26:02,115 INFO L226 Difference]: Without dead ends: 60 [2020-12-09 20:26:02,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=269, Invalid=991, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 20:26:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-12-09 20:26:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2020-12-09 20:26:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-09 20:26:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2020-12-09 20:26:02,117 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 29 [2020-12-09 20:26:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:02,117 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2020-12-09 20:26:02,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 20:26:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2020-12-09 20:26:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-09 20:26:02,117 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:02,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:02,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2020-12-09 20:26:02,318 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:26:02,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:02,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1655949125, now seen corresponding path program 1 times [2020-12-09 20:26:02,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:26:02,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29197352] [2020-12-09 20:26:02,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2020-12-09 20:26:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:02,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-09 20:26:02,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:02,536 INFO L382 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 [2020-12-09 20:26:02,537 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:02,538 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:02,538 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:02,539 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:26:02,561 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:02,561 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-12-09 20:26:02,562 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:02,568 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:02,568 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:02,568 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2020-12-09 20:26:02,594 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:02,595 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:02,609 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:02,612 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:02,612 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:02,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:02,623 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:02,623 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2020-12-09 20:26:02,681 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:02,682 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2020-12-09 20:26:02,682 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:02,698 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:02,699 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:02,699 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:38 [2020-12-09 20:26:02,797 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:02,798 INFO L382 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 77 [2020-12-09 20:26:02,799 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 20:26:02,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:26:02,800 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:02,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:02,823 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2020-12-09 20:26:02,824 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:02,838 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:02,839 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:02,839 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:60 [2020-12-09 20:26:03,076 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:03,077 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 142 [2020-12-09 20:26:03,079 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-09 20:26:03,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:26:03,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 20:26:03,080 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-09 20:26:03,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:26:03,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 20:26:03,083 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2020-12-09 20:26:03,187 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2020-12-09 20:26:03,187 INFO L625 ElimStorePlain]: treesize reduction 505, result has 18.4 percent of original size [2020-12-09 20:26:03,242 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:03,242 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 146 [2020-12-09 20:26:03,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:26:03,244 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:03,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:03,267 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:03,267 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:130, output treesize:60 [2020-12-09 20:26:03,288 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:03,288 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 46 [2020-12-09 20:26:03,290 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:03,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:03,301 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:03,301 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:23 [2020-12-09 20:26:03,342 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2020-12-09 20:26:03,344 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:03,349 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:03,350 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:03,350 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:3 [2020-12-09 20:26:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:26:03,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:26:03,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29197352] [2020-12-09 20:26:03,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:26:03,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-09 20:26:03,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229809739] [2020-12-09 20:26:03,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 20:26:03,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:26:03,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 20:26:03,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-12-09 20:26:03,374 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 16 states. [2020-12-09 20:26:04,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:04,959 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-12-09 20:26:04,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 20:26:04,960 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2020-12-09 20:26:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:04,960 INFO L225 Difference]: With dead ends: 58 [2020-12-09 20:26:04,960 INFO L226 Difference]: Without dead ends: 58 [2020-12-09 20:26:04,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 20:26:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-12-09 20:26:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2020-12-09 20:26:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 20:26:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2020-12-09 20:26:04,962 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 30 [2020-12-09 20:26:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:04,962 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2020-12-09 20:26:04,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 20:26:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-12-09 20:26:04,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-09 20:26:04,962 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:04,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:05,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2020-12-09 20:26:05,163 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:26:05,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:05,164 INFO L82 PathProgramCache]: Analyzing trace with hash -205184559, now seen corresponding path program 1 times [2020-12-09 20:26:05,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:26:05,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691485432] [2020-12-09 20:26:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2020-12-09 20:26:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:05,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-09 20:26:05,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:05,336 INFO L382 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 [2020-12-09 20:26:05,337 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:05,338 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:05,338 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:05,338 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:26:05,363 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:05,363 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-09 20:26:05,364 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:05,370 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:05,370 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:05,370 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:17 [2020-12-09 20:26:05,393 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:05,394 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:05,408 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:05,411 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:05,411 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:05,423 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:05,423 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:05,424 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2020-12-09 20:26:05,481 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:05,481 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-12-09 20:26:05,482 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:05,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:05,503 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:05,503 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:38 [2020-12-09 20:26:05,591 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2020-12-09 20:26:05,592 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:05,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:05,635 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:05,635 INFO L382 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 73 [2020-12-09 20:26:05,636 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 20:26:05,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:26:05,637 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:05,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:05,657 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:05,657 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:60 [2020-12-09 20:26:05,844 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_37|], 6=[|v_#memory_$Pointer$.base_51|]} [2020-12-09 20:26:05,865 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:05,865 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 116 [2020-12-09 20:26:05,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:26:05,867 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:05,889 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:05,950 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:05,950 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 130 [2020-12-09 20:26:05,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:26:05,953 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:26:05,953 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-09 20:26:05,953 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:26:05,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:26:05,955 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-09 20:26:05,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 20:26:05,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 20:26:05,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 20:26:05,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 20:26:05,957 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 20:26:06,021 INFO L625 ElimStorePlain]: treesize reduction 107, result has 47.8 percent of original size [2020-12-09 20:26:06,022 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:06,022 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:130, output treesize:60 [2020-12-09 20:26:06,029 INFO L382 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 59 treesize of output 43 [2020-12-09 20:26:06,030 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:06,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:06,046 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:06,046 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:55 [2020-12-09 20:26:06,099 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:06,099 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 34 [2020-12-09 20:26:06,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:26:06,101 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:06,107 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:06,108 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:06,108 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:3 [2020-12-09 20:26:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:26:06,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:26:06,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691485432] [2020-12-09 20:26:06,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:26:06,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-09 20:26:06,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019326411] [2020-12-09 20:26:06,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 20:26:06,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:26:06,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 20:26:06,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-12-09 20:26:06,142 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 16 states. [2020-12-09 20:26:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:09,194 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2020-12-09 20:26:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 20:26:09,195 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2020-12-09 20:26:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:09,195 INFO L225 Difference]: With dead ends: 56 [2020-12-09 20:26:09,195 INFO L226 Difference]: Without dead ends: 56 [2020-12-09 20:26:09,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 20:26:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-12-09 20:26:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2020-12-09 20:26:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-09 20:26:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2020-12-09 20:26:09,197 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 31 [2020-12-09 20:26:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:09,197 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2020-12-09 20:26:09,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 20:26:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-12-09 20:26:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 20:26:09,197 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:09,197 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:09,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2020-12-09 20:26:09,399 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:26:09,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:09,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2065753913, now seen corresponding path program 1 times [2020-12-09 20:26:09,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:26:09,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258132240] [2020-12-09 20:26:09,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2020-12-09 20:26:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:09,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-09 20:26:09,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:09,571 INFO L382 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 [2020-12-09 20:26:09,572 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:09,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:09,574 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:09,574 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:26:09,604 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:09,604 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-12-09 20:26:09,605 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:09,613 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:09,613 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:09,613 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2020-12-09 20:26:09,648 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:09,648 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:09,667 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:09,671 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:09,672 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:09,687 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:09,688 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:09,689 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2020-12-09 20:26:09,760 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:09,760 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2020-12-09 20:26:09,761 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:09,776 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:09,776 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:09,776 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2020-12-09 20:26:09,849 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2020-12-09 20:26:09,850 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:09,875 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:09,906 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:09,907 INFO L382 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 73 [2020-12-09 20:26:09,908 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 20:26:09,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:26:09,908 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:09,926 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:09,927 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:09,927 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:45 [2020-12-09 20:26:10,077 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_40|], 6=[|v_#memory_$Pointer$.base_54|]} [2020-12-09 20:26:10,103 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:10,104 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 118 [2020-12-09 20:26:10,105 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-09 20:26:10,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:26:10,106 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-12-09 20:26:10,187 INFO L625 ElimStorePlain]: treesize reduction 229, result has 33.6 percent of original size [2020-12-09 20:26:10,258 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:10,258 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 132 [2020-12-09 20:26:10,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:26:10,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:26:10,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:26:10,262 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-09 20:26:10,262 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-09 20:26:10,263 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-09 20:26:10,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 20:26:10,264 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-09 20:26:10,264 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 20:26:10,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:26:10,267 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2020-12-09 20:26:10,332 INFO L625 ElimStorePlain]: treesize reduction 217, result has 32.0 percent of original size [2020-12-09 20:26:10,334 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:10,334 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:132, output treesize:64 [2020-12-09 20:26:10,381 INFO L382 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 63 treesize of output 47 [2020-12-09 20:26:10,382 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:10,397 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:10,398 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:10,398 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:78, output treesize:57 [2020-12-09 20:26:10,457 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:10,457 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 38 [2020-12-09 20:26:10,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:26:10,459 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:10,465 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:10,466 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:10,466 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:63, output treesize:7 [2020-12-09 20:26:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:26:10,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:26:10,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258132240] [2020-12-09 20:26:10,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:26:10,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-09 20:26:10,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343810585] [2020-12-09 20:26:10,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 20:26:10,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:26:10,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 20:26:10,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-12-09 20:26:10,500 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2020-12-09 20:26:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:12,225 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-12-09 20:26:12,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-09 20:26:12,226 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2020-12-09 20:26:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:12,226 INFO L225 Difference]: With dead ends: 54 [2020-12-09 20:26:12,226 INFO L226 Difference]: Without dead ends: 54 [2020-12-09 20:26:12,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=303, Invalid=1179, Unknown=0, NotChecked=0, Total=1482 [2020-12-09 20:26:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-09 20:26:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2020-12-09 20:26:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-09 20:26:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2020-12-09 20:26:12,228 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 32 [2020-12-09 20:26:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:12,228 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2020-12-09 20:26:12,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 20:26:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-12-09 20:26:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 20:26:12,228 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:12,228 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:12,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2020-12-09 20:26:12,429 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:26:12,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:12,429 INFO L82 PathProgramCache]: Analyzing trace with hash 386138261, now seen corresponding path program 1 times [2020-12-09 20:26:12,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:26:12,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633146390] [2020-12-09 20:26:12,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2020-12-09 20:26:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:12,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-09 20:26:12,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:12,669 INFO L382 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 [2020-12-09 20:26:12,670 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:12,671 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:12,672 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:12,672 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:26:12,695 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:12,695 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-09 20:26:12,696 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:12,701 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:12,702 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:12,702 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:17 [2020-12-09 20:26:12,726 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:12,726 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:12,740 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:12,742 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:12,743 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:12,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:12,755 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:12,755 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2020-12-09 20:26:12,829 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:12,830 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 91 [2020-12-09 20:26:12,831 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:12,850 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:12,851 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:12,851 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:56 [2020-12-09 20:26:12,956 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:12,956 INFO L382 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 82 [2020-12-09 20:26:12,957 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-09 20:26:12,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:26:12,958 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:12,986 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:12,991 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2020-12-09 20:26:12,992 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:13,015 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:13,016 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:13,017 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:78 [2020-12-09 20:26:13,272 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:13,272 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 183 [2020-12-09 20:26:13,274 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:13,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:13,312 INFO L547 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. [2020-12-09 20:26:13,313 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:106, output treesize:126 [2020-12-09 20:26:13,454 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_43|], 6=[|v_#memory_$Pointer$.base_57|]} [2020-12-09 20:26:13,480 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:13,480 INFO L382 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 130 [2020-12-09 20:26:13,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:26:13,482 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:13,530 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:13,596 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:13,597 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 147 [2020-12-09 20:26:13,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-12-09 20:26:13,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 20:26:13,600 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-12-09 20:26:13,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-09 20:26:13,601 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-12-09 20:26:13,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-09 20:26:13,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-09 20:26:13,605 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2020-12-09 20:26:13,749 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-12-09 20:26:13,749 INFO L625 ElimStorePlain]: treesize reduction 614, result has 19.7 percent of original size [2020-12-09 20:26:13,750 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:13,750 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:181, output treesize:111 [2020-12-09 20:26:13,894 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 79 treesize of output 59 [2020-12-09 20:26:13,896 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:13,929 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:13,931 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:13,931 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:127, output treesize:100 [2020-12-09 20:26:14,008 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:14,009 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 53 [2020-12-09 20:26:14,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:26:14,011 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:14,040 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:14,041 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:14,041 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:49 [2020-12-09 20:26:14,122 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2020-12-09 20:26:14,124 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:14,166 INFO L625 ElimStorePlain]: treesize reduction 12, result has 75.5 percent of original size [2020-12-09 20:26:14,167 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:14,167 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:37 [2020-12-09 20:26:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:26:14,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:26:14,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633146390] [2020-12-09 20:26:14,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:26:14,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-09 20:26:14,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233876008] [2020-12-09 20:26:14,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-09 20:26:14,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:26:14,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-09 20:26:14,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2020-12-09 20:26:14,232 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 19 states. [2020-12-09 20:26:23,565 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-12-09 20:26:23,777 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2020-12-09 20:26:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:23,906 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2020-12-09 20:26:23,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-09 20:26:23,906 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2020-12-09 20:26:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:23,907 INFO L225 Difference]: With dead ends: 61 [2020-12-09 20:26:23,907 INFO L226 Difference]: Without dead ends: 61 [2020-12-09 20:26:23,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=261, Invalid=929, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 20:26:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-09 20:26:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2020-12-09 20:26:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 20:26:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2020-12-09 20:26:23,908 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 33 [2020-12-09 20:26:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:23,908 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2020-12-09 20:26:23,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-09 20:26:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2020-12-09 20:26:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 20:26:23,909 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:23,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:24,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2020-12-09 20:26:24,110 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:26:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:24,111 INFO L82 PathProgramCache]: Analyzing trace with hash -6888749, now seen corresponding path program 1 times [2020-12-09 20:26:24,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:26:24,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19900090] [2020-12-09 20:26:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2020-12-09 20:26:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:24,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-09 20:26:24,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:24,270 INFO L382 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 [2020-12-09 20:26:24,270 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:24,271 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:24,272 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:24,272 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:26:24,293 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:24,294 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-09 20:26:24,295 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:24,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:24,300 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:24,300 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:17 [2020-12-09 20:26:24,323 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:24,324 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:24,337 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:24,340 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:24,340 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:24,351 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:24,352 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:24,353 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2020-12-09 20:26:24,442 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:24,442 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 91 [2020-12-09 20:26:24,444 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:24,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:24,468 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:24,468 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:56 [2020-12-09 20:26:24,576 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:24,576 INFO L382 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 82 [2020-12-09 20:26:24,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-09 20:26:24,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:26:24,578 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:24,604 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:24,609 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2020-12-09 20:26:24,610 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:24,632 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:24,633 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:24,633 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:78 [2020-12-09 20:26:24,818 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_46|], 6=[|v_#memory_$Pointer$.base_60|]} [2020-12-09 20:26:24,843 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:24,843 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 120 [2020-12-09 20:26:24,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:26:24,845 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:24,881 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:24,956 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:24,956 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 139 [2020-12-09 20:26:24,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-09 20:26:24,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 20:26:24,962 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-12-09 20:26:24,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-09 20:26:24,963 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-09 20:26:24,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 20:26:24,964 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 20:26:24,964 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 20:26:24,965 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-09 20:26:24,965 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:26:24,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:26:24,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-09 20:26:24,967 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-09 20:26:24,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:26:24,971 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2020-12-09 20:26:25,173 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2020-12-09 20:26:25,174 INFO L625 ElimStorePlain]: treesize reduction 1491, result has 7.2 percent of original size [2020-12-09 20:26:25,175 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:25,175 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:148, output treesize:80 [2020-12-09 20:26:25,201 INFO L382 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 63 treesize of output 47 [2020-12-09 20:26:25,202 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:25,225 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:25,226 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:25,226 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:94, output treesize:75 [2020-12-09 20:26:25,283 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:25,283 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 41 [2020-12-09 20:26:25,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:26:25,285 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:25,299 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:25,300 INFO L547 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. [2020-12-09 20:26:25,300 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:30 [2020-12-09 20:26:25,433 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2020-12-09 20:26:25,435 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:25,452 INFO L625 ElimStorePlain]: treesize reduction 8, result has 75.0 percent of original size [2020-12-09 20:26:25,453 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:25,453 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:22 [2020-12-09 20:26:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:26:25,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:26:25,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19900090] [2020-12-09 20:26:25,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:26:25,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-09 20:26:25,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760624291] [2020-12-09 20:26:25,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 20:26:25,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:26:25,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 20:26:25,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-12-09 20:26:25,505 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 17 states. [2020-12-09 20:26:40,848 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-12-09 20:26:41,006 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-12-09 20:26:41,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:41,133 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-12-09 20:26:41,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-09 20:26:41,133 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2020-12-09 20:26:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:41,134 INFO L225 Difference]: With dead ends: 54 [2020-12-09 20:26:41,134 INFO L226 Difference]: Without dead ends: 54 [2020-12-09 20:26:41,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2020-12-09 20:26:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-09 20:26:41,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2020-12-09 20:26:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-09 20:26:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2020-12-09 20:26:41,135 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 33 [2020-12-09 20:26:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:41,135 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2020-12-09 20:26:41,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 20:26:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2020-12-09 20:26:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 20:26:41,136 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:41,136 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:41,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2020-12-09 20:26:41,337 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:26:41,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:41,338 INFO L82 PathProgramCache]: Analyzing trace with hash -914615733, now seen corresponding path program 1 times [2020-12-09 20:26:41,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:26:41,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096859939] [2020-12-09 20:26:41,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2020-12-09 20:26:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:41,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-09 20:26:41,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:41,473 INFO L382 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 [2020-12-09 20:26:41,474 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,475 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,475 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,475 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:26:41,490 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,490 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 20:26:41,491 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,497 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,497 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,497 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2020-12-09 20:26:41,524 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:41,524 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,538 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:41,538 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,545 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,545 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-12-09 20:26:41,598 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,599 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 20:26:41,599 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,611 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,612 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,612 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:34 [2020-12-09 20:26:41,674 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2020-12-09 20:26:41,674 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,690 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,713 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,713 INFO L382 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 53 [2020-12-09 20:26:41,714 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-09 20:26:41,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:26:41,714 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,727 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,728 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,728 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:28 [2020-12-09 20:26:41,873 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,873 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2020-12-09 20:26:41,874 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 20:26:41,874 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 20:26:41,876 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,881 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,882 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,882 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:12 [2020-12-09 20:26:41,914 INFO L382 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 19 treesize of output 18 [2020-12-09 20:26:41,915 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,925 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,926 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,926 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2020-12-09 20:26:41,946 INFO L382 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 [2020-12-09 20:26:41,947 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:41,949 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:41,949 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-12-09 20:26:41,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:26:41,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:26:41,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096859939] [2020-12-09 20:26:41,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:26:41,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-09 20:26:41,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923385141] [2020-12-09 20:26:41,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 20:26:41,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:26:41,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 20:26:41,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-12-09 20:26:41,978 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 16 states. [2020-12-09 20:26:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:43,075 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2020-12-09 20:26:43,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-09 20:26:43,075 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2020-12-09 20:26:43,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:43,075 INFO L225 Difference]: With dead ends: 64 [2020-12-09 20:26:43,075 INFO L226 Difference]: Without dead ends: 64 [2020-12-09 20:26:43,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 20:26:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-09 20:26:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 44. [2020-12-09 20:26:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-12-09 20:26:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2020-12-09 20:26:43,077 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 34 [2020-12-09 20:26:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:43,077 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2020-12-09 20:26:43,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 20:26:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2020-12-09 20:26:43,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 20:26:43,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:43,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:43,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2020-12-09 20:26:43,279 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:26:43,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:43,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1711683477, now seen corresponding path program 1 times [2020-12-09 20:26:43,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:26:43,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661744707] [2020-12-09 20:26:43,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2020-12-09 20:26:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:43,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 20:26:43,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:43,463 INFO L382 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 [2020-12-09 20:26:43,464 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:43,465 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:43,466 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:43,466 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:26:43,481 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:43,481 INFO L382 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 [2020-12-09 20:26:43,482 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:43,488 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:43,488 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:43,488 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-12-09 20:26:43,517 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:43,517 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:43,526 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:43,526 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:43,526 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2020-12-09 20:26:43,586 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:43,586 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-12-09 20:26:43,587 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:43,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:43,602 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:43,602 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:34 [2020-12-09 20:26:43,680 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2020-12-09 20:26:43,680 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:43,698 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:43,721 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:43,721 INFO L382 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 72 [2020-12-09 20:26:43,722 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 20:26:43,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:26:43,723 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:43,739 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:43,739 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:43,740 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:32 [2020-12-09 20:26:43,823 INFO L382 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 24 treesize of output 16 [2020-12-09 20:26:43,823 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:43,835 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:43,835 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:43,836 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:35 [2020-12-09 20:26:43,996 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:43,997 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 99 [2020-12-09 20:26:43,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:26:43,999 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-09 20:26:43,999 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-09 20:26:43,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:26:44,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:26:44,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:26:44,001 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-09 20:26:44,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:26:44,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 20:26:44,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:26:44,003 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 20:26:44,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:26:44,004 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-09 20:26:44,067 INFO L625 ElimStorePlain]: treesize reduction 43, result has 63.2 percent of original size [2020-12-09 20:26:44,068 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-12-09 20:26:44,068 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:45 [2020-12-09 20:26:44,092 INFO L382 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 [2020-12-09 20:26:44,093 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:44,099 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:44,099 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:44,100 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2020-12-09 20:26:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:26:44,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:26:44,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661744707] [2020-12-09 20:26:44,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:26:44,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-09 20:26:44,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370615939] [2020-12-09 20:26:44,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 20:26:44,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:26:44,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 20:26:44,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-12-09 20:26:44,130 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 15 states. [2020-12-09 20:26:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:48,764 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2020-12-09 20:26:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-09 20:26:48,765 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2020-12-09 20:26:48,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:48,765 INFO L225 Difference]: With dead ends: 62 [2020-12-09 20:26:48,765 INFO L226 Difference]: Without dead ends: 62 [2020-12-09 20:26:48,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=217, Invalid=772, Unknown=3, NotChecked=0, Total=992 [2020-12-09 20:26:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-12-09 20:26:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2020-12-09 20:26:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-12-09 20:26:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2020-12-09 20:26:48,766 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 35 [2020-12-09 20:26:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:48,766 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2020-12-09 20:26:48,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 20:26:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-12-09 20:26:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 20:26:48,767 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:48,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:48,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2020-12-09 20:26:48,968 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:26:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1522580365, now seen corresponding path program 1 times [2020-12-09 20:26:48,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:26:48,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261956257] [2020-12-09 20:26:48,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2020-12-09 20:26:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:49,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 34 conjunts are in the unsatisfiable core [2020-12-09 20:26:49,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:49,210 INFO L382 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 [2020-12-09 20:26:49,210 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,212 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:49,212 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,212 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 20:26:49,236 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:49,236 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-09 20:26:49,237 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:49,243 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,243 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:17 [2020-12-09 20:26:49,267 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-09 20:26:49,267 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,275 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:49,275 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,275 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2020-12-09 20:26:49,328 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:49,328 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2020-12-09 20:26:49,329 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,341 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:49,342 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,342 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2020-12-09 20:26:49,424 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:49,424 INFO L382 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 77 [2020-12-09 20:26:49,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-09 20:26:49,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:26:49,426 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:49,448 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2020-12-09 20:26:49,449 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,465 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:49,467 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,467 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:45 [2020-12-09 20:26:49,618 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_52|], 6=[|v_#memory_$Pointer$.base_68|]} [2020-12-09 20:26:49,643 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:49,643 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 105 [2020-12-09 20:26:49,644 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-09 20:26:49,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:26:49,645 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-12-09 20:26:49,712 INFO L625 ElimStorePlain]: treesize reduction 195, result has 33.7 percent of original size [2020-12-09 20:26:49,779 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:49,780 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 127 [2020-12-09 20:26:49,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 20:26:49,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:26:49,782 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-09 20:26:49,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 20:26:49,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 20:26:49,784 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-09 20:26:49,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:26:49,784 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-09 20:26:49,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-09 20:26:49,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:26:49,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:26:49,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-09 20:26:49,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:26:49,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 20:26:49,788 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2020-12-09 20:26:49,859 INFO L625 ElimStorePlain]: treesize reduction 395, result has 17.4 percent of original size [2020-12-09 20:26:49,860 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,860 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:115, output treesize:45 [2020-12-09 20:26:49,866 INFO L382 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 44 treesize of output 32 [2020-12-09 20:26:49,867 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,881 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:49,881 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:49,882 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2020-12-09 20:26:49,979 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-12-09 20:26:49,980 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:50,004 INFO L625 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2020-12-09 20:26:50,004 INFO L547 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. [2020-12-09 20:26:50,004 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:43 [2020-12-09 20:26:50,064 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:50,064 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 39 [2020-12-09 20:26:50,065 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 20:26:50,066 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:50,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:50,076 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:50,076 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:11 [2020-12-09 20:26:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:26:50,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:26:50,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261956257] [2020-12-09 20:26:50,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:26:50,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-12-09 20:26:50,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644238442] [2020-12-09 20:26:50,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 20:26:50,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:26:50,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 20:26:50,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2020-12-09 20:26:50,124 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 18 states. [2020-12-09 20:26:56,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:56,563 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2020-12-09 20:26:56,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-09 20:26:56,563 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2020-12-09 20:26:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:56,564 INFO L225 Difference]: With dead ends: 50 [2020-12-09 20:26:56,564 INFO L226 Difference]: Without dead ends: 50 [2020-12-09 20:26:56,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=256, Invalid=1150, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 20:26:56,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-12-09 20:26:56,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2020-12-09 20:26:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-09 20:26:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2020-12-09 20:26:56,565 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2020-12-09 20:26:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:56,565 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2020-12-09 20:26:56,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 20:26:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-12-09 20:26:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 20:26:56,565 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:56,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:56,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2020-12-09 20:26:56,767 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:26:56,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:56,768 INFO L82 PathProgramCache]: Analyzing trace with hash 42172794, now seen corresponding path program 1 times [2020-12-09 20:26:56,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:26:56,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344433373] [2020-12-09 20:26:56,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2020-12-09 20:26:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:56,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 20:26:56,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:56,943 INFO L382 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 18 treesize of output 17 [2020-12-09 20:26:56,944 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:56,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:56,950 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 20:26:56,950 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2020-12-09 20:26:56,969 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-12-09 20:26:56,972 INFO L382 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 25 treesize of output 17 [2020-12-09 20:26:56,973 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:56,982 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:56,991 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:56,991 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2020-12-09 20:26:56,991 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 20:26:56,992 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 20:26:56,992 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:57,011 INFO L625 ElimStorePlain]: treesize reduction 3, result has 87.0 percent of original size [2020-12-09 20:26:57,012 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:57,012 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:20 [2020-12-09 20:26:57,068 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 20:26:57,068 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2020-12-09 20:26:57,070 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 20:26:57,087 INFO L625 ElimStorePlain]: treesize reduction 22, result has 42.1 percent of original size [2020-12-09 20:26:57,088 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 20:26:57,088 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:16 [2020-12-09 20:26:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:26:57,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 20:26:57,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344433373] [2020-12-09 20:26:57,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:26:57,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 20:26:57,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170569552] [2020-12-09 20:26:57,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 20:26:57,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 20:26:57,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 20:26:57,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-12-09 20:26:57,113 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 10 states. [2020-12-09 20:27:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:27:01,520 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-12-09 20:27:01,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 20:27:01,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2020-12-09 20:27:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:27:01,520 INFO L225 Difference]: With dead ends: 41 [2020-12-09 20:27:01,520 INFO L226 Difference]: Without dead ends: 41 [2020-12-09 20:27:01,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2020-12-09 20:27:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-12-09 20:27:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-12-09 20:27:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-09 20:27:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2020-12-09 20:27:01,521 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2020-12-09 20:27:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:27:01,522 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2020-12-09 20:27:01,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 20:27:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-12-09 20:27:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-09 20:27:01,522 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:27:01,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:27:01,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2020-12-09 20:27:01,723 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 20:27:01,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:27:01,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1307356755, now seen corresponding path program 1 times [2020-12-09 20:27:01,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 20:27:01,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137128457] [2020-12-09 20:27:01,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fb2f81d-fcf7-465f-8525-c6d67258003c/bin/utaipan/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2020-12-09 20:27:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 20:27:01,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 20:27:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 20:27:02,009 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 20:27:02,054 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-12-09 20:27:02,055 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 20:27:02,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3 [2020-12-09 20:27:02,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:27:02 BoogieIcfgContainer [2020-12-09 20:27:02,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 20:27:02,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 20:27:02,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 20:27:02,320 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 20:27:02,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:24:52" (3/4) ... [2020-12-09 20:27:02,322 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 20:27:02,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 20:27:02,323 INFO L168 Benchmark]: Toolchain (without parser) took 130819.58 ms. Allocated memory was 65.0 MB in the beginning and 119.5 MB in the end (delta: 54.5 MB). Free memory was 46.2 MB in the beginning and 53.6 MB in the end (delta: -7.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 16.1 GB. [2020-12-09 20:27:02,323 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 65.0 MB. Free memory is still 47.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 20:27:02,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.33 ms. Allocated memory was 65.0 MB in the beginning and 98.6 MB in the end (delta: 33.6 MB). Free memory was 46.0 MB in the beginning and 66.1 MB in the end (delta: -20.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 16.1 GB. [2020-12-09 20:27:02,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.89 ms. Allocated memory is still 98.6 MB. Free memory was 66.1 MB in the beginning and 63.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:27:02,323 INFO L168 Benchmark]: Boogie Preprocessor took 22.66 ms. Allocated memory is still 98.6 MB. Free memory was 63.7 MB in the beginning and 61.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:27:02,323 INFO L168 Benchmark]: RCFGBuilder took 456.38 ms. Allocated memory is still 98.6 MB. Free memory was 61.9 MB in the beginning and 62.8 MB in the end (delta: -908.2 kB). Peak memory consumption was 14.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:27:02,324 INFO L168 Benchmark]: TraceAbstraction took 129854.24 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 62.2 MB in the beginning and 53.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 29.5 MB. Max. memory is 16.1 GB. [2020-12-09 20:27:02,324 INFO L168 Benchmark]: Witness Printer took 2.56 ms. Allocated memory is still 119.5 MB. Free memory is still 53.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 20:27:02,325 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 65.0 MB. Free memory is still 47.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 439.33 ms. Allocated memory was 65.0 MB in the beginning and 98.6 MB in the end (delta: 33.6 MB). Free memory was 46.0 MB in the beginning and 66.1 MB in the end (delta: -20.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.89 ms. Allocated memory is still 98.6 MB. Free memory was 66.1 MB in the beginning and 63.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.66 ms. Allocated memory is still 98.6 MB. Free memory was 63.7 MB in the beginning and 61.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 456.38 ms. Allocated memory is still 98.6 MB. Free memory was 61.9 MB in the beginning and 62.8 MB in the end (delta: -908.2 kB). Peak memory consumption was 14.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 129854.24 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 62.2 MB in the beginning and 53.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 29.5 MB. Max. memory is 16.1 GB. * Witness Printer took 2.56 ms. Allocated memory is still 119.5 MB. Free memory is still 53.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 786]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 786. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={1039:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={1039:0}] [L773] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L774] COND FALSE !(!a10) [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={1039:0}] [L775] a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) VAL [ldv_global_msg_list={1039:0}] [L776] EXPR a10->b VAL [ldv_global_msg_list={1039:0}] [L776] COND FALSE !(!a10->b) [L777] EXPR a10->b VAL [ldv_global_msg_list={1039:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={1039:0}] [L777] a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) VAL [ldv_global_msg_list={1039:0}] [L778] EXPR a10->b VAL [ldv_global_msg_list={1039:0}] [L778] EXPR a10->b->c VAL [ldv_global_msg_list={1039:0}] [L778] COND FALSE !(!a10->b->c) [L767] EXPR a->b VAL [ldv_global_msg_list={1039:0}] [L767] EXPR a->b->c VAL [ldv_global_msg_list={1039:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={1039:0}] [L767] a->b->c->p = (int *)ldv_malloc(sizeof(int)) VAL [ldv_global_msg_list={1039:0}] [L780] EXPR a10->b VAL [ldv_global_msg_list={1039:0}] [L780] EXPR a10->b->c VAL [ldv_global_msg_list={1039:0}] [L780] free(a10->b->c) VAL [ldv_global_msg_list={1039:0}] [L780] free(a10->b->c) VAL [ldv_global_msg_list={1039:0}] [L780] free(a10->b->c) [L782] EXPR a10->b VAL [ldv_global_msg_list={1039:0}] [L782] free(a10->b) VAL [ldv_global_msg_list={1039:0}] [L782] free(a10->b) VAL [ldv_global_msg_list={1039:0}] [L782] free(a10->b) [L784] free(a10) VAL [ldv_global_msg_list={1039:0}] [L784] free(a10) VAL [ldv_global_msg_list={1039:0}] [L784] free(a10) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 34 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 129.7s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 97.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1353 SDtfs, 5537 SDslu, 4084 SDs, 0 SdLazy, 8403 SolverSat, 870 SolverUnsat, 32 SolverUnknown, 0 SolverNotchecked, 78.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1170 GetRequests, 471 SyntacticMatches, 14 SemanticMatches, 685 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3296 ImplicationChecksByTransitivity, 27.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 37 MinimizatonAttempts, 1431 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 874 NumberOfCodeBlocks, 874 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 797 ConstructedInterpolants, 95 QuantifiedInterpolants, 484931 SizeOfPredicates, 562 NumberOfNonLiveVariables, 3907 ConjunctsInSsa, 662 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...